#include "tree.h"

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

#include <random>

mt19937_64 rng(60);

int N;
vector<int> dep, par;
int lca[1010][1010];

int dist(int u, int v) {
  const int l = lca[u][v];
  assert(l);
  return dep[u] + dep[v] - 2 * dep[l];
}

void classify(const vector<int> &us, const vector<int> &vs) {
  if (vs.empty()) return;
  const int usLen = us.size();
  assert(usLen >= 1);
  if (usLen == 1) {
    for (const int v : vs) par[v] = us[0];
  } else if (usLen == 2) {
    for (const int v : vs) par[v] = us[(ask(us[0], {v}) == 1) ? 0 : 1];
  } else {
    vector<int> fs(usLen, 0);
    for (int j = 0; j < usLen / 2; ++j) fs[j] = 1;
    shuffle(fs.begin(), fs.end(), rng);
    vector<int> ws;
    for (int j = 0; j < usLen; ++j) if (fs[j]) ws.push_back(us[j]);
    map<int, vector<int>> uss, vss;
    for (const int u : us) {
      int sum = 0;
      for (const int w : ws) sum += dist(u, w);
      uss[sum].push_back(u);
    }
    for (const int v : vs) vss[ask(v, ws)].push_back(v);
    for (const auto &kv : vss) {
      auto it = uss.find(kv.first - (int)ws.size());
      assert(it != uss.end());
      classify(it->second, kv.second);
    }
  }
}

void solver(int N_, int, int) {
  N = N_;
  int R = rng() % N + 1;
  dep.assign(N + 1, 0);
  for (int u = 1; u <= N; ++u) if (R != u) dep[u] = ask(R, {u});
  vector<vector<int>> layers(N);
  for (int u = 1; u <= N; ++u) layers[dep[u]].push_back(u);
// cerr<<"R = "<<R<<", dep = "<<dep<<", layers = "<<layers<<endl;
  par.assign(N + 1, 0);
  lca[R][R] = 1;
  for (int d = 1; d < N; ++d) {
    classify(layers[d - 1], layers[d]);
    for (const int u : layers[d]) for (const int v : layers[d]) {
      lca[u][v] = (u == v) ? u : lca[par[u]][par[v]];
    }
  }
  for (int u = 1; u <= N; ++u) if (R != u) answer(par[u], u);
}