寻找字典序最小的欧拉路或者欧拉回路（修改起点即可

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
const int MAXN=1000010;
int n , m;
//前向星
/*
int head[MAXN] , cnt;

struct node{
    int t, next;
    int w;
}edge[MAXN*10];
void add(int f, int t)
{
    edge[Cnt].t = t;
    edge[Cnt].next = head[f];
    head[f] = Cnt ++;
}
*/
int head[MAXN], cnt = -1;
struct node{
    int t , id;
    node (int a, int b): t(a), id(b){}
    bool operator < (const node& no) const{
        return t < no.t;
    }
};
vector<node> edge[MAXN];
//euler
int  st[MAXN], ans[MAXN], top, t, start = 1;
bool vis[MAXN];
void euler()
{
    st[++ top] = start;
    while(top > 0)
    {
        int u = st[top];
        int ok = 1;
        for(int i = head[u] ; i < edge[u].size() ; i ++)
        {
            int id = edge[u][i].id, v = edge[u][i].t;
            if(!vis[id])
            {
                ok = 0;
                st[++ top] = v;
                vis[id] = vis[id ^ 1] = 1;
                head[u] = i + 1;
                break;
            }
        }
        if(ok) {
            top--;
            ans[++t] = u;
        }
    }
}
int main(void)
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
    mem(head,0);
    mem(vis,0);
    int u , v;
    cin>>m;
    for(int i = 1 ; i <= m ; i ++)
    {
        cin>>u>>v;
        n = max(n,v);
        n = max(n,u);
        edge[u].pb(node(v,++ cnt));
        edge[v].pb(node(u,++ cnt));
    }
    for(int i = 1 ; i <= n ; i ++)
        sort(edge[i].begin(),edge[i].end());
    //这个起点适用于求欧拉通路
    //如果求欧拉回路，应该改为edge[i].size()%2==0
    for(int i = 1 ; i <= n ; i ++) {
        if (edge[i].size() % 2) {
            start = i;
            break;
        }
    }

    euler();
    for(int i = t ; i >= 1 ; i --)
        cout<<ans[i]<<endl;


}