#include <bits/stdc++.h>
#include "Memory2_lib.h"
using namespace std;
void Solve(int T, int N) {
    pair <int,int> wartosci[2*N + 2];
    int i = 0;
    int j = 1;
    int k = 2;
    int ans1 = 0;
    int ans2 = 0;
    int carryover = Flip(i,j);
    for(;k < 2*N; k++) {
        ans1 = Flip(i,k);
        ans2 = Flip(j,k);
        if(ans1 == ans2 && ans1 == carryover) {
            //cout << k << "\n";
            int kbis = k;
            k++;
            for(;k < 2*N;k++) {
                ans1 = Flip(i,k);
                ans2 = Flip(j,k);
                //cout << ans1 << " " << ans2 << '\n';
                if(ans1 == carryover && ans2 != carryover) {
                    wartosci[i] = {ans1,i};
                    i=j;
                    j=kbis;
                    break;
                }
                else if(ans2 == carryover && ans1 != carryover) {
                    wartosci[j] = {ans2,j};
                    j=kbis;
                    break;
                }
                else if(ans1 == ans2 && carryover != ans1){
                    wartosci[k] = {ans1,k};
                }
                else {
                    //cout <<k << "\n";
                    wartosci[i] = {carryover,i};
                    wartosci[j] = {carryover,j};
                    i = kbis;
                    j = k;
                    //carryover = Flip(i,j);
                    ans1 = -1;
                    ans2 = -2;
                    k++;
                    break;
                }
            }
            carryover = Flip(i,j);
            if(k < 2*N) {
                ans1 = Flip(i,k);
                ans2 = Flip(j,k);
            }
        }
        if(k==2*N) break;
        if(ans1 == carryover && ans2 != carryover) {
            wartosci[i] = {ans1,i};
            carryover = ans2;
            i=j;
            j=k;
        }
        else if(ans2 == carryover && ans1 != carryover) {
            wartosci[j] = {ans2,j};
            carryover = ans1;
            j=k;
        }
        else if(ans1 == ans2 && carryover != ans1){
            wartosci[k] = {ans1,k};
        }
    }
    wartosci[i] = {carryover, i};
    wartosci[j] = {carryover, j};
    /*for(int i = 0; i < 2*N; i++) {
        cout << wartosci[i].first << " " << wartosci[i].second << "\n";
    }*/
    sort(wartosci, wartosci+2*N);
    for(int i = 0 ; i < 2*N; i+=2) {
        //cout << i << "\n";
        Answer(wartosci[i].second, wartosci[i+1].second, wartosci[i].first);
    }
}