#include "Memory2_lib.h"
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef vector<int> vi;
map<pair<int,int>,int> m;
int li;
void upd(vi curr){
    vi v;
    for(int i=0;i<curr.size();i++){
        int n1=curr[(i+1)%curr.size()],akt=curr[i];
        if(!(m.count(make_pair(akt,n1)))){
            m[make_pair(akt,n1)]=Flip(akt,n1);
            m[make_pair(n1,akt)]=m[make_pair(akt,n1)];
            //li++;
        }
    }
}
void Solve(int T, int n){
    m.clear();
    vi curr;
    for(int i=0;i<n*2;i++) curr.push_back(i);
    for(int i=0;i<n-1;i++){
        //cout<<i<<"\n";
        upd(curr);
        bool zn=0;
        vi curr2;
        for(int i2=0;i2<curr.size();i2++){
            for(int i3=i2+1;i3<curr.size();i3++){
                if(zn) continue;
                int xd=-1;
                //if(curr.size()<8) xd=Flip(curr[i2],curr[i3]);
                bool ok=1;
                for(int i4=-1;i4<=1;i4++){
                    if(i4==0) continue;
                    int prv=curr[(i2+i4+curr.size())%curr.size()];
                    if(xd==-1) xd=m[make_pair(prv,curr[i2])];
                    if(xd!=m[make_pair(prv,curr[i2])]) ok=0;
                }
                for(int i4=-1;i4<=1;i4++){
                    if(i4==0) continue;
                    int prv=curr[(i3+i4+curr.size())%curr.size()];
                    if(xd!=m[make_pair(prv,curr[i3])]) ok=0;
                }
                if(!ok) continue;
                pair<int,int> r={i2,i3};
                if(i2==i3-1){
                    if(Flip(curr[i2],curr[(i3+1)%curr.size()])!=xd){
                        r.fi--;
                    }
                    if(Flip(curr[i3],curr[(i2-1+curr.size())%curr.size()])!=xd){
                        r.se++;
                    }
                }else{
                    if(i2==0 and i3==curr.size()-1){
                        if(Flip(curr[i2],curr[(i3-1+curr.size())%curr.size()])!=xd){
                            r.fi++;
                        }
                        if(Flip(curr[i3],curr[(i2+1+curr.size())%curr.size()])!=xd){
                            r.se--;
                        }
                    }else{
                        if(Flip(curr[i2],curr[(i3-1+curr.size())%curr.size()])!=xd){
                            r.fi--;
                        }
                        if(Flip(curr[i3],curr[(i2+1+curr.size())%curr.size()])!=xd){
                            r.se++;
                        }
                    }
                }
                r.fi+=curr.size(),r.se+=curr.size();
                r.fi%=curr.size(),r.se%=curr.size();
                Answer(curr[r.fi],curr[r.se],xd); 
                for(int i4=0;i4<curr.size();i4++){
                    if(i4!=r.fi and i4!=r.se) curr2.push_back(curr[i4]);
                }
                zn=1;
            }
        }
        curr=curr2;
    } 
    Answer(curr[0],curr[1],Flip(curr[0],curr[1]));
}