#include <bits/stdc++.h>
#include "Memory2_lib.h"

using namespace std;

struct que{
    int i;
    int j;
    int x;
};

int ile[115][115];
int known[115];
int czy[115];
pair <int, int> ans[115];
vector <int> sus;
vector <que> queris;

int felipe(int i, int j){
    /*int x;
    cout << "FLIP: " << i << ' ' << j << '\n';
    cin >> x;*/
    int x=Flip(i, j);
    return x;
}

void answ(int i, int j, int x){
    //cout << "ANSWER: " << i << ' ' << j << ' ' << x << '\n';
    Answer(i, j, x);
}

void Solve(int T, int N)
{
    /*cout << "T N\n";
    int T, N;
    cin >> T >> N;*/
    int t=T, n=N, i, j, a, b, x, fur=0, k;
    for(i=0; i<2*n; i++){
        known[i]=-1;
    }
    for(i=0; i<2*n; i++){
        ans[i]={-1, -1};
        if(known[i]==-1){
            k=queris.size();
            for(j=i+1; j<2*n; j++){
                if(known[j]!=-1){
                    continue;
                }
                else{
                    x=felipe(i, j);
                }
                queris.push_back({i, j, x});
                czy[x]++;
                ile[i][x]++;
                if(ile[i][x]>=3){
                    known[i]=x;
                    break;
                }
            }
            if(j==2*n){
                a=-1;
                for(j=0; j<n; j++){
                    if(czy[j]==1){
                        a=j;
                        break;
                    }
                }
                if(a==-1){
                    for(j=k; j<queris.size(); j++){
                        if(queris[j].j==fur){
                            x=queris[j].x;
                            break;
                        }
                    }
                    a=-1;
                    b=-1;
                    for(j=k; j<queris.size(); j++){
                        if(queris[j].x==x){
                            if(a==-1){
                                a=queris[j].j;
                            }
                            else{
                                b=queris[j].j;
                            }
                        }
                    }
                    known[i]=x;
                    x=felipe(a, b);
                    known[a]=x;
                    known[b]=x;
                }
                else{
                    known[i]=a;
                    for(j=k; j<queris.size(); j++){
                        known[queris[j].j]=queris[j].x;
                    }
                }
            }
            fur=max(fur, j);
            for(j=k; j<queris.size(); j++){
                if(queris[j].x!=known[i]){
                    known[queris[j].j]=queris[j].x;
                }
            }
        }
    }
    for(i=0; i<2*n; i++){
        if(ans[known[i]].first==-1){
            ans[known[i]].first=i;
        }
        else{
            ans[known[i]].second=i;
        }
    }
    for(i=0; i<n; i++){
        answ(ans[i].first, ans[i].second, i);
    }
}