#include<bits/stdc++.h>
#include"Memory2_lib.h"
#define For(i,a,b) for(register int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(register int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 105
#define inf 0x3f3f3f3f

mt19937_64 rnd(924844033);
inline int gen(int l,int r){return rnd()%(r-l+1)+l;}

int n,a[maxn],c[maxn],col[maxn];
int st[maxn],top;

void work()
{
	int u=gen(1,top);
	For(i,1,n)c[i]=0;
	For(i,1,top)
		if(u!=i)
			col[i]=Flip(st[u]-1,st[i]-1)+1,
			c[col[i]]++;
	For(i,1,n)
		if(c[i]&1){
			col[u]=i;
			++c[i];
		}
	vector<int>o;
	For(i,1,top)
		if(c[col[i]]<=2) a[st[i]]=col[i];
		else o.pb(st[i]);
	top=0;
	for(auto it:o)
		st[++top]=it;
}

void Solve(int T,int N)
{
	n=N;
	For(i,1,n*2)st[++top]=i;
	while(top) work();
	For(i,1,n*2)For(j,i+1,n*2)if(a[i]==a[j])Answer(i-1,j-1,a[i]-1);
}