#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
bool v[105];
int ans[105];
vector<int> g[105];
void BFS(int s) {
queue<int> que;
que.push(s);
v[s]=1;
while (!que.empty()) {
int t=que.front();
que.pop();
for (int i=0;i<g[t].size();i++) {
if (v[g[t][i]]==0) {
ans[g[t][i]]=t;
v[g[t][i]]=1;
que.push(g[t][i]);
}
}
}
}
int main() {
int n;
cin>>n;
for (int i=0;i<n-1;i++) {
int a,b;
cin>>a>>b;
g[a].push_back(b);
g[b].push_back(a);
}
BFS(1);
for (int i=2;i<=n;i++) {
cout<<ans[i]<<" ";
}
return 0;
}
