#include <bits/stdc++.h>
// #include <windows.h>
// #include <bits/extc++.h>
// using namespace __gnu_pbds;
using namespace std;
//#pragma GCC optimize(3)
#define DB double
#define LL long long
#define ULL unsigned long long
#define in128 __int128
#define cint const int
#define cLL const LL
#define For(z,e1,e2) for(int z=(e1);z<=(e2);z++)
#define Rof(z,e1,e2) for(int z=(e2);z>=(e1);z--)
#define For_(z,e1,e2) for(int z=(e1);z<(e2);z++)
#define Rof_(z,e1,e2) for(int z=(e2);z>(e1);z--)
#define inint(e) scanf("%d",&e)
#define inll(e) scanf("%lld",&e)
#define inpr(e1,e2) scanf("%d%d",&e1,&e2)
#define in3(e1,e2,e3) scanf("%d%d%d",&e1,&e2,&e3)
#define outint(e) printf("%d\n",e)
#define outint_(e) printf("%d%c",e," \n"[i==n])
#define outint2_(e,e1,e2) printf("%d%c",e," \n"[(e1)==(e2)])
#define outll(e) printf("%lld\n",e)
#define outll_(e) printf("%lld%c",e," \n"[i==n])
#define outll2_(e,e1,e2) printf("%lld%c",e," \n"[(e1)==(e2)])
#define exc(e) if(e) continue
#define stop(e) if(e) break
#define ret(e) if(e) return
#define ll(e) (1ll*(e))
#define pb push_back
#define ft first
#define sc second
#define pii pair<int,int> 
#define pli pair<long long,int> 
#define vct vector 
#define clean(e) while(!e.empty()) e.pop()
#define all(ev) ev.begin(),ev.end()
#define sz(ev) ((int)ev.size())
#define debug(x) printf("%s=%d\n",#x,x)
#define x0 __xx00__
#define y1 __yy11__
#define ffo fflush(stdout)
cLL mod=998244353,G=404;
// cLL mod[2]={1686688681ll,1666888681ll},base[2]={166686661ll,188868881ll};
template <typename Type> void get_min(Type &w1,const Type w2) { if(w2<w1) w1=w2; } template <typename Type> void get_max(Type &w1,const Type w2) { if(w2>w1) w1=w2; }
template <typename Type> Type up_div(Type w1,Type w2) { return (w1/w2+(w1%w2?1:0)); }
template <typename Type> Type gcd(Type X_,Type Y_) { Type R_=X_%Y_; while(R_) { X_=Y_; Y_=R_; R_=X_%Y_; } return Y_; } template <typename Type> Type lcm(Type X_,Type Y_) { return (X_/gcd(X_,Y_)*Y_); }
template <typename Type> Type md(Type w1,const Type w2=mod) { w1%=w2; if(w1<0) w1+=w2; return w1; } template <typename Type> Type md_(Type w1,const Type w2=mod) { w1%=w2; if(w1<=0) w1+=w2; return w1; }
void ex_gcd(LL &X_,LL &Y_,LL A_,LL B_) { if(!B_) { X_=1ll; Y_=0ll; return ; } ex_gcd(Y_,X_,B_,A_%B_); X_=md(X_,B_); Y_=(1ll-X_*A_)/B_; } LL inv(LL A_,LL B_=mod) { LL X_=0ll,Y_=0ll; ex_gcd(X_,Y_,A_,B_); return X_; }
template <typename Type> void add(Type &w1,const Type w2,const Type M_=mod) { w1=md(w1+w2,M_); } void mul(LL &w1,cLL w2,cLL M_=mod) { w1=md(w1*md(w2,M_),M_); } template <typename Type> Type pw(Type X_,Type Y_,Type M_=mod) { Type S_=1; while(Y_) { if(Y_&1) mul(S_,X_,M_); Y_>>=1; mul(X_,X_,M_); } return S_; }
template <typename Type> Type bk(vector <Type> &V_) { auto T_=V_.back(); V_.pop_back(); return T_; } template <typename Type> Type tp(stack <Type> &V_) { auto T_=V_.top(); V_.pop(); return T_; } template <typename Type> Type frt(queue <Type> &V_) { auto T_=V_.front(); V_.pop(); return T_; }
template <typename Type> Type bg(set <Type> &V_) { auto T_=*V_.begin(); V_.erase(V_.begin()); return T_; } template <typename Type> Type bk(set <Type> &V_) { auto T_=*prev(V_.end()); V_.erase(*prev(V_.end())); return T_; }
mt19937 gen(time(NULL)); int rd() { return abs((int)gen()); }
int rnd(int l,int r) { return rd()%(r-l+1)+l; }

void main_init()
{

}
cint N=1020;
int n;
int deg[N];
vct <array<int,2> > v1[N],v2[N];
vct <array<int,2> > ans;
vct <int> v[N];
bool b[N],vis[N];
void dfs(int p)
{
    vis[p]=true;
    for(auto i:v[p]) if(!vis[i])
        dfs(i);
}
void fin(int p,int p2,vct <array<int,3> > &e)
{
    For(i,1,n) v[i].clear(),vis[i]=false;
    for(auto [x,y,id]:e) v[x].pb(y),v[y].pb(x);
    vis[p]=true;
    dfs(p2);
}
void clr(int p,vct <array<int,3> > &e)
{
    vct <array<int,3> > tmp;
    for(auto [x,y,id]:e) if(x!=p&&y!=p)
        tmp.pb({x,y,id});
    e.swap(tmp);
}
void main_solve()
{
    inint(n);
    // n=1000;
    vct <array<int,3> > e1,e2;
    ans.clear();
    For_(i,1,n)
    {
        int x,y; inpr(x,y);
        // int x=rnd(1,i),y=i+1; if(rnd(0,1)) swap(x,y);
        e1.pb({x,y,i});
    }
    // For_(i,0,n-1) swap(e1[i],e1[rnd(0,i)]);
    For_(i,1,n)
    {
        int x,y; inpr(x,y);
        // int x=rnd(1,i),y=i+1; if(rnd(0,1)) swap(x,y);
        e2.pb({x,y,i});
    }
    // For_(i,0,n-1) swap(e2[i],e2[rnd(0,i)]);
    For(i,1,n) b[i]=false;
    For_(round,1,n)
    {
        For(i,1,n) deg[i]=0,v1[i].clear(),v2[i].clear();
        for(auto [x,y,id]:e1) deg[x]++,deg[y]++,v1[x].pb({y,id}),v1[y].pb({x,id});
        for(auto [x,y,id]:e2) deg[x]++,deg[y]++,v2[x].pb({y,id}),v2[y].pb({x,id});
        int p=0;
        For(i,1,n) if((!b[i])&&((!p)||deg[i]<deg[p]))
            p=i;
        b[p]=true;
        // printf("p=%d\n",p);
        if(deg[p]<=1||v1[p].empty()||v2[p].empty()) exit(1);
        if(deg[p]==2)
            ans.pb({v1[p][0][1],v2[p][0][1]});
        else if(sz(v1[p])==1)
        {
            fin(p,v2[p][1][0],e2);
            int k=(int)(vis[v1[p][0][0]]);
            ans.pb({v1[p][0][1],v2[p][k][1]});
            e2.pb({v2[p][!k][0],v1[p][0][0],v2[p][!k][1]});
        }
        else
        {
            fin(p,v1[p][1][0],e1);
            int k=(vis[v2[p][0][0]]);
            ans.pb({v2[p][0][1],v1[p][k][1]});
            e1.pb({v1[p][!k][0],v2[p][0][0],v1[p][!k][1]});
        }
        clr(p,e1); clr(p,e2);
        // printf("e1\n");
        // for(auto [x,y,id]:e1) printf("%d %d %d\n",x,y,id);
        // printf("e2\n");
        // for(auto [x,y,id]:e2) printf("%d %d %d\n",x,y,id);
    }
    For_(i,0,n-1) printf("%d ",ans[i][0]); printf("\n");
    For_(i,0,n-1) printf("%d ",ans[i][1]); printf("\n");
    // For_(i,0,n-1) For_(j,i+1,n-1)
    // {
    //     if(ans[i][0]==ans[j][0]||ans[i][1]==ans[j][1])
    //     {
    //         printf("???\n");
    //         exit(1);
    //     }
    // }
}
int main()
{
    // ios::sync_with_stdio(0); cin.tie(0);
    // freopen("in.txt","r",stdin);
    // freopen("out.txt","w",stdout);
    // srand(time(NULL));
    main_init();
    // int _; inint(_); For(__,1,_) // T>1 ?
        // printf("\n------------\n\n"),
        main_solve();
    return 0;
}
/*

*/