#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")


vector<int> solve(int N) {
  vector<int> A(N + 1, -1);
  for (int u = 2; u <= N; ++u) A[u] = query({u});
  vector<int> us(N + 1);
  for (int u = 1; u <= N; ++u) us[u] = u;
  sort(us.begin() + 2, us.end(), [&](int u, int v) -> bool {
    return (A[u] > A[v]);
  });
  vector<int> par(N + 1, -1);
  for (int j = 2; j <= N; ++j) {
    const int u = us[j];
    // par[u] \in us[lo, hi)
    int lo = 1, hi = j;
    for (; lo + 1 < hi; ) {
      const int mid = (lo + hi) / 2;
      vector<int> vs(us.begin() + mid, us.begin() + hi);
      const int res0 = (vs.size() == 1) ? A[vs[0]] : query(vs);
      vs.push_back(u);
      const int res1 = query(vs);
      ((res0 == res1) ? lo : hi) = mid;
    }
    par[u] = us[lo];
  }
cerr<<"par = "<<par<<endl;
  par.erase(par.begin(), par.begin() + 2);
  return par;
}