#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

using namespace std;

int n,m;

int ans[],vis[],map[][];

bool dfs(int now,int tot){

    if(tot==n+&&now==)    return true;

    for(int i=;i<=n;i++)

        if(map[now][i]&&!vis[i]){

            vis[i]=;map[now][i]=map[i][now]=;ans[tot]=i;

            if(dfs(i,tot+))    return true;

            vis[i]=;map[now][i]=map[i][now]=;

        }

    return false;

}

int main(){

    scanf("%d",&n);

    int a,b;

    while(scanf("%d%d",&a,&b)!=EOF)

        map[a][b]=map[b][a]=;

    dfs(,);

    cout<<""<<" ";

    for(int i=;i<n;i++)

        cout<<ans[i]<<" ";

}