#include "chameleon.h"
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>
using namespace std;
typedef long long ll;
void Solve(int n) {
vector <vector <int>> g(2 * n);
int cnt_qr = 0;
map <vector <int>, int> ans;
function <int(vector <int>)> my_query = [&] (const vector <int> &p) {
vector <int> a = p;
sort(a.begin(), a.end());
for (int &x : a) ++x;
if (!ans.count(a)) {
++cnt_qr;
ans[a] = Query(a);
}
return ans[a];
};
vector <int> col(2 * n, -1);
function <void(int)> dfs = [&] (int u) {
for (auto v : g[u]) {
if (col[v] == -1) {
col[v] = col[u] ^ 1;
dfs(v);
}
}
};
for (int v = 0; v < 2 * n; ++v) {
if (!g[v].empty()) continue;
fill(col.begin(), col.end(), -1);
for (int i = 0; i < 2 * n; ++i) {
if (col[i] == -1) {
col[i] = 0;
dfs(i);
}
}
for (int t = 0; t < 2; ++t) {
vector <int> q;
for (int i = 0; i < v; ++i) if (col[i] == t) q.push_back(i);
while (!q.empty()) {
q.push_back(v);
if (my_query(q) == (int)q.size()) break;
q.pop_back();
int l = 0, r = (int)q.size();
while (r - l > 1) {
int m = (l + r) >> 1;
vector <int> a = vector <int> (q.begin(), q.begin() + m);
a.push_back(v);
if (my_query(a) == (int)a.size()) l = m;
else r = m;
}
g[v].push_back(q[l]);
g[q[l]].push_back(v);
q = vector <int> (q.begin() + r, q.end());
}
}
}
vector <int> who(2 * n, -1);
vector <set <int>> bad(2 * n);
for (int i = 0; i < 2 * n; ++i) {
if (g[i].size() == 1) {
who[i] = g[i][0];
who[g[i][0]] = i;
} else if (g[i].size() == 3) {
for (int j = 0; j < 3; ++j) {
vector <int> p = {i};
for (int k = 0; k < 3; ++k) {
if (k != j) p.push_back(g[i][k]);
}
if (my_query(p) == 1) {
bad[i].insert(g[i][j]);
bad[g[i][j]].insert(i);
}
}
} else {
assert(false);
}
}
for (int i = 0; i < 2 * n; ++i) {
if (who[i] == -1) {
for (int j = 0; j < (int)g[i].size(); ++j) {
if (!bad[i].count(g[i][j])) {
who[i] = g[i][j];
}
}
}
}
for (int i = 0; i < 2 * n; ++i) {
if (who[i] > i) {
Answer(i + 1, who[i] + 1);
}
}
}
