#include "Memory2_lib.h"
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

const int N=109;
int vst[N],a[N],f[N][N],ans[N],del[N];
pii p[N],g[N],h[N];

int qry(int i,int j) {
	if(i>j) swap(i,j);
	if(~f[i][j]) return f[i][j];
	else return f[i][j]=Flip(i,j);
}
void Solve(int T,int n) {
	rep(i,0,2*n-1) rep(j,0,2*n-1) f[i][j]=-1;
	rep(i,0,n-1) p[i]=pii(i,i+n);
	rep(t,0,n-1) {	
		rep(i,0,n-1) vst[i]=-1; bool flag=0;
		rep(i,0,n-1) if(!del[i]) {
			int x=qry(p[i].fi,p[i].se);
			if(~vst[x]) {
				int xa=g[x].fi, ya=g[x].se;
				int xb=p[i].fi, yb=p[i].se;
				if(qry(xa,xb)!=x) {
					ans[ya]=ans[yb]=x;
					p[i]=pii(xa,xb);
				} else if(qry(ya,yb)!=x) {
					ans[xa]=ans[xb]=x;
					p[i]=pii(ya,yb);
				} else if(qry(xa,yb)!=x) {
					ans[ya]=ans[xb]=x;
					p[i]=pii(xa,yb);
				} else {
					ans[xa]=ans[yb]=x;
					p[i]=pii(ya,xb);
				}
				del[vst[x]]=1; flag=1; break;
			}
			g[x]=p[i], vst[x]=i;
		}
		if(!flag) {
			rep(i,0,n-1) if(!del[i]) {
				int x=p[i].fi, y=p[i].se, f=qry(x,y);
				ans[x]=ans[y]=f;
			}
			break;
		}
	}
	rep(i,0,2*n-1) {
		if(!h[ans[i]].fi) h[ans[i]].fi=i;
		else h[ans[i]].se=i;
	}
	rep(i,0,n-1) Answer(h[i].fi,h[i].se,i);
}