#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>;
void Solve(int N) {
vector<pair<int, int>> pary;
for(int i=1; i<=2*N; ++i) {
for(int j=i+1; j<=2*N; ++j) {
vector<int> p = {i,j};
if(Query(p)==1) {
pary.push_back({i,j});
cout << i << " " << j << "\n";
}
}
}
for(auto[a,b] : pary) {
vector<int> v;
vector<int> p = {a,b};
for(int k=1; k<=2*N; ++k) {
if(k==a || k==b) continue;
p.push_back(k);
if(Query(p)==2) v.push_back(k);
p.pop_back();
}
Answer(v[0], v[1]);
}
}
