#include<bits/stdc++.h>
#include<vector>
using namespace std;
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fod(i,a,b) for(int i=a;i>=b;--i)
int ask(int u,std::vector<int>v);
void answer(int u,int v);

vector<int>S[1011];
int bz[1011];
int f[1011];
bool cmp(int x,int y){
	return f[x]<f[y];
}
void solve(vector<int>A,vector<int>B){
	if(!B.size()){
		return ;
	}
	if(A.size()==1){
		while(B.size()){
			if(ask(A[0],{B.back()})==1){
				bz[B.back()]=1;
				answer(A[0],B.back());
			}
			B.pop_back();
		}
		return ;
	}
	int mid=A.size()/2-1;
	vector<int>C;
	fo(i,0,mid){
		C.push_back(A[i]);
	}
	vector<int>C2;
	fo(i,mid+1,A.size()-1){
		f[A[i]]=ask(A[i],C);
		C2.push_back(A[i]);
	}
	fo(i,0,B.size()-1){
		f[B[i]]=ask(B[i],C);
	}
	sort(B.begin(),B.end(),cmp);
	sort(C2.begin(),C2.end(),cmp);
	int fir=0;
	fo(i,0,C2.size()-1){
		if(i==0||f[C2[i]]!=f[C2[i-1]]){
			while(fir<B.size()&&f[C2[i]]>f[B[fir]]-C.size())++fir;
			int las=fir;
			while(las<B.size()&&f[C2[i]]==f[B[las]]-C.size())++las;
			vector<int>D,D2;
			fo(j,fir,las-1)D2.push_back(B[j]);
			int r=i;
			while(r<C2.size()&&f[C2[r]]==f[C2[i]]){
				D.push_back(C2[r++]);
			}
			solve(D,D2);
		}
	}
	vector<int>B2;
	fo(i,0,B.size()-1){
		if(!bz[B[i]])B2.push_back(B[i]);
	}
	solve(C,B);
}
void solver(int n,int A,int B)
{
	fo(i,2,n){
		int u=ask(1,{i});
		S[u].push_back(i);
		if(u==1)answer(1,i);
	}
	fo(i,2,n){
		if(!S[i].size())break;
		solve(S[i-1],S[i]);
	}
}