#include <bits/stdc++.h>
#include "icc.h"
using namespace std;
// int query(int size_a, int size_b, int a[], int b[]);
// void setRoad(int a, int b);
const int MAX = 105;
int n, ncomp;
vector<int> G[MAX];
vector<int> comp[MAX];
vector<int> buf[2];
bool vis[MAX];
int tmp[2][MAX];
int Query(vector<int> &a, vector<int> &b) {
for (int i = 0; i < a.size(); ++i) tmp[0][i] = a[i] + 1;
for (int i = 0; i < b.size(); ++i) tmp[1][i] = b[i] + 1;
return query(a.size(), b.size(), tmp[0], tmp[1]);
}
void reset() {
ncomp = 0;
for (int i = 0; i < n; ++i) comp[i].clear(), vis[i] = 0;
for (int i = 0; i < n; ++i) if (!vis[i]) {
queue <int> q; q.push(i); vis[i] = 1;
while(!q.empty()) {
int u = q.front(); q.pop();
comp[ncomp].push_back(u);
for (int i = 0; i < G[u].size(); ++i) {
int v = G[u][i];
if (!vis[v]) q.push(v), vis[v] = 1;
}
}
++ncomp;
}
}
vector<int> modify(vector<int> &a) {
vector<int> ret;
for (int i = 0; i < a.size(); ++i) {
int cur = a[i];
for (int j = 0; j < comp[cur].size(); ++j) ret.push_back(comp[cur][j]);
}
return ret;
}
int ask(vector<int> &a, vector<int> &b, int l, int r) {
if (l == r) return a[l];
int mid = ((l + r) >> 1);
vector<int> lef;
for (int i = l; i <= mid; ++i) lef.push_back(a[i]);
if (Query(lef, b)) return ask(a, b, l, mid); // left
else return ask(a, b, mid + 1, r); // right
}
void solve() {
reset();
// the current number of nodes: ncomp [0...ncomp-1]
int nbit = (int)log2(ncomp - 1) + 1;
for (int bit = 0; bit < nbit; ++bit) {
buf[0].clear();
buf[1].clear();
for (int i = 0; i < ncomp; ++i) {
buf[i >> bit & 1].push_back(i);
}
buf[0] = modify(buf[0]);
buf[1] = modify(buf[1]);
int ans = Query(buf[0], buf[1]);
if (ans) { // different at {bit}
break;
}
}
int u = ask(buf[0], buf[1], 0, buf[0].size() - 1);
int v = ask(buf[1], buf[0], 0, buf[1].size() - 1);
setRoad(u + 1, v + 1);
G[u].push_back(v); G[v].push_back(u);
}
void run(int N) {
n = N;
for (int i = 1; i < n; ++i) solve();
}
