// Author: Kajetan Ramsza
#include "bits/stdc++.h"
#include "Memory2_lib.h"
using namespace std;

#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

template<typename F, typename S> ostream& operator<<(ostream& os, const pair<F, S> &p) { return os<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T> ostream &operator<<(ostream & os, const vector<T> &v) { os << "{"; typename vector< T > :: const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) { if( it != v.begin() ) os << ", "; os << *it; } return os << "}"; }

void dbg_out() { cerr<<'\n'; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr<<' '<<H; dbg_out(T...); }

#ifdef DEBUG
#define dbg(...) cerr<<"(" << #__VA_ARGS__ <<"):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 
#endif

int random(int a, int b) {
	return rand() % (b-a+1) + a;
}

int n;
vi cards;
vector<vi> ind;
vector<vi> queries;
int num = 0;

int query(int a, int b) {
	if(queries[a][b] != -1) return queries[a][b];
	return queries[a][b] = queries[b][a] = Flip(a, b);
}

void ask(int a, int b, int c) {
	int ab = query(a, b);
	int bc = query(b, c);
	int ca = query(c, a);
	if(ab == bc && bc == ca) return;
	if(ab == bc) {
		cards[b] = ab;
		ind[ab].push_back(b);
	}
	else if(bc == ca) {
		cards[c] = bc;
		ind[bc].push_back(c);
	}
	else if(ca == ab) {
		cards[a] = ca;
		ind[ca].push_back(a);
	}
	else assert(false);
	num++;
}

vi generate() {
	vi take(2*n - num, 0);
	take[0] = take[1] = take[2] = 1;
	random_shuffle(all(take));
	int pnt = 0;
	vi res;
	rep(i,0,2*n)
		if(cards[i] == -1 && take[pnt++])
			 res.push_back(i);
	return res;
}

void brute_force(const vi &pos) {
	dbg(pos);
	if(sz(pos) == 2) {
		rep(i,0,n) if(sz(ind[i]) == 0) {
			ind[i] = pos;
			cards[pos[0]] = cards[pos[1]] = i;
			return;
		}
		rep(i,0,n) {
			int que = query(pos[0], ind[i][0]);
			if(que != i) {
				ind[que].push_back(pos[0]);
				cards[pos[0]] = que;
				return;
			}
		}
		cards[pos[1]] = query(pos[0], pos[1]);
		ind[query(pos[0], pos[1])].push_back(pos[1]);
		return;
	}
	rep(i,0,sz(pos)) {
		vi vals;
	 	rep(j,0,sz(pos))
	 		if(i != j) vals.push_back(query(pos[i], pos[j]));
	 	bool same = true;
	 	for(auto x : vals)
	 		same &= x == vals[0];
	 	if(!same) continue;
 		cards[pos[i]] = vals[0];
 		ind[vals[0]].push_back(pos[i]);
 		vi new_pos;
 		rep(j,0,sz(pos)) if(i != j)
 			new_pos.push_back(pos[j]);
 		brute_force(new_pos);
 		break;
	}
}

void Solve(int t, int n_) {
	n = n_;
	dbg(t, n);
	srand(time(NULL));
	cards.assign(2*n, -1);
	queries.assign(2*n, vi(2*n, -1));
	ind.resize(n);
	while(num+4 < 2*n) {
		vi v = generate();
		ask(v[0], v[1], v[2]);
	}
	dbg(cards);
	vi pos;
	rep(i,0,2*n) if(cards[i] == -1) pos.push_back(i);
	brute_force(pos);
	int index = 0;
	rep(i,0,2*n) if(cards[i] == -1) index = i;
	rep(i,0,n)
		if(sz(ind) != 2) {
			cards[index] = i;
			ind[i].push_back(index);
		}
	dbg(cards);
	rep(i,0,n) {
		Answer(ind[i][0], ind[i][1], i);
	}
}