#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
#include "chameleon.h"
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
set<pair<int, int>> Sa;
void Ans(int x, int y) {
if(x>y) swap(x,y);
if(x==y) return;
Sa.insert({x,y});
}
void Finish() {
for(auto[a,b] : Sa) Answer(a,b);
}
void Solve(int N) {
vector<set<int>> V(2*N+1);
vector<vector<int>> vvv(2*N+1);
for(int i=1; i<=2*N; ++i) {
for(int j=1; j<=2*N; ++j) {
if(i==j) continue;
vector<int> p;
p.push_back(i);
p.push_back(j);
if(Query(p)==1) {
V[i].insert(j);
vvv[i].push_back(j);
}
}
}
for(int i=1; i<=2*N; ++i) {
if(V[i].size()==1) Ans(i,*V[i].begin());
else {
vector<int> v;
for(auto x : vvv[i]) v.push_back(x);
for(int j=0; j<3; ++j) {
vector<int> p = {i};
for(int x=0; x<3; ++x) if(x!=j) p.push_back(v[x]);
if(Query(p)==1) {
V[i].erase(v[j]);
V[v[j]].erase(i);
}
}
}
}
for(int i=1; i<=2*N; ++i) {
if(V[i].size()==1) Ans(i,*V[i].begin());
}
Finish();
}
