#include<bits/stdc++.h>
using namespace std;
int n;
vector<int>v[200010];
void dfs(int x,int fa)
{
	cout<<x<<" ";
	for(auto y:v[x])
	{
		if(y!=fa)
		{
			dfs(y,x);
		}
	}
	if(x!=1)
	{
		cout<<fa<<" ";
	}
}
signed main()
{
	cin>>n;
	for(int i=1;i<n;i++)
	{
		int a,b;
		cin>>a>>b;
		v[a].push_back(b);
		v[b].push_back(a);
	}
	for(int i=1;i<=n;i++)
	{
		sort(v[i].begin(),v[i].end());
	}
	dfs(1,0);
    return 0;
}