#include "tree.h"
#include<bits/stdc++.h>
using namespace std;
const int MX = 1005;
vector<int > c[MX];int dep[MX];
void solve(vector<int > A,vector<int > B){
	if(A.size() == 1){
		for(auto it : B)answer(A[0],it);
		return;
	}
	if(B.size() == 0)return;
	int p = A.size() / 2;vector<int > LA,RA,LB,RB;
	for(int i = 0;i < p;i++)LA.push_back(A[i]);
	for(int i = p;i < A.size();i++)RA.push_back(B[i]);
	int std = ask(LA[0],LA);
	for(auto it : B){
		int cur = ask(it,LA);
		if(cur == std + LA.size())LB.push_back(it);
		else RB.push_back(it);
	}
	solve(LA,LB);solve(RA,RB);
}
void solver(int n,int A,int B){
	vector<int > tmp;tmp.push_back(1);
	int mx = 0;c[0].push_back(1);
	for(int i = 2;i <= n;i++){
		dep[i] = ask(i,tmp);
		c[dep[i]].push_back(i);
		mx = max(mx,dep[i]);
	}
	for(int i = 0;i < mx;i++)solve(c[i],c[i + 1]);
}