#include "tree.h"
#include <bits/stdc++.h>
// int ask(int u,std::vector<int>v);
// void answer(int u,int v);
using namespace std;

// #define int long long
#define PB emplace_back
#define siz(a) ((int) (a.size()))
#define vi vector<int>
#define ll long long
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

const int N = 1000;
int s[N + 5][N + 5];
bool vis[N + 5];
vi f[N + 5];

void solve(vi n, vi m) {
	if(siz(n) == 1) {
		rep(j, 0, siz(m) - 1) {
			// cerr << n[0] << ' ' << m[j] << endl;
			answer(n[0], m[j]);
		}
		return;
	}
	if(!siz(m)) return;
	vi L, R;
	rep(j, 0, siz(n) / 2 - 1) L.PB(n[j]);
	rep(j, siz(L), siz(n) - 1) R.PB(n[j]);
	vi wr(siz(R));
	rep(i, 0, siz(R) - 1) wr[i] = ask(R[i], L);
	vi l, r;
	rep(i, 0, siz(m) - 1) {
		int x = m[i], tmp = ask(x, L);
		rep(j, 0, siz(R) - 1) if(wr[j] + siz(L) == tmp) r.PB(x); else l.PB(x);
	}
	solve(L, l), solve(R, r);
}
void solver(int a, int b, int c) {
	int rt = min(114, a);
	rep(i, 1, a) {
		int x = ask(rt, {i});
		if(x == 1) answer(rt, i);
		f[x].PB(i);
	}
	rep(i, 1, a) solve(f[i], f[i + 1]);
}

// signed main() {
// 	freopen("b.in", "r", stdin);
// 	freopen("b.out", "w", stdout);
// 	ios::sync_with_stdio(0);
// 	cin.tie(0), cout.tie(0);

// 	return 0;
// }