#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");
vector <int> G[1000];
bitset <10> v;
int n,i;
citire(){

    fin>>n;
    for(int i=1;i<=n;i++)
    {int x,y;
    fin>>x>>y;
    G[y].push_back(x);
    G[x].push_back(y);
    }
}
void dfs(int k){
    v[k]=1;
    fout<<k<<" ";
    for(int i=1;i<=(int)G[k].size();i++){
        int vecin=G[k][i];
        if( v[vecin]!=0)
            dfs(vecin);
    }

}

int main()
{
    int k;
    fin>>k;
   citire();
   dfs(k);

   return 0;
}