#include <bits/stdc++.h>
const int N = 1e3 + 5;
int ask(int u,std::vector<int>v);
void answer(int u,int v);
typedef std::vector<int> Set_nd;
int n;
int dep[N];
std::random_device rd;
std::mt19937 Rnd(19260817);
int dis[N];
inline bool cmp(const int &x,const int &y) { return dis[x] < dis[y];}
void Solve_set(Set_nd &A,Set_nd &B)
{
	if(A.empty() || B.empty()) return;
	if(A.size() == 1)
	{
		for(auto it : B)
		{
			// if(ask(it,A) != 1)
			// {
			// 	printf("more:%d,%d\n",it,A[0]);
			// }
			answer(A[0],it);
		}
		return;
	}
	if(B.size() == 1)
	{
		for(auto it : A)
			if(ask(it,B) == 1) {answer(it,B[0]);break;}
		return;
	}
	Set_nd Poi;
	for(auto it : A) if(Rnd() % 2) Poi.push_back(it);
	while(Poi.empty()) for(auto it : A) if(Rnd() % 2) Poi.push_back(it);
	// printf("Poi:%d\n",Poi.size());

	for(auto it : A) dis[it] = ask(it,Poi);
	for(auto it : B) dis[it] = ask(it,Poi);
	std::sort(A.begin(),A.end(),cmp);
	std::sort(B.begin(),B.end(),cmp);
	for(int l = 0,r,lb = 0,rb = -1;l < A.size();l = r + 1)
	{
		r = l;
		while(r + 1 < A.size() && dis[A[r + 1]] == dis[A[l]]) ++r;
		while(lb < B.size() && dis[B[lb]] < dis[A[l]] + Poi.size()) ++lb;
		while(rb + 1 < B.size() && dis[B[rb + 1]] <= dis[A[l]] + Poi.size()) ++rb;
		// printf("lb,rb:%d,%d,%d\n",lb,rb,B.size());
		// if(lb <= rb)
		// {
			Set_nd ta,tb;
			for(int i = l;i <= r;i++) ta.push_back(A[i]);
			for(int i = 0;i < B.size();i++)
				if(dis[B[i]] == dis[A[l]] + Poi.size()) tb.push_back(B[i]);
			// for(int i = lb;i <= rb;i++) tb.push_back(B[i]);
			if(tb.size()) Solve_set(ta,tb);
		// }
	}	
}
std::vector<int> Nd[N];
void solver(int _n,int A,int B)
{
	n = _n;
	for(int i = 1;i <= n;i++)
		dep[i] = ask(i,Set_nd(1,1));
	for(int i = 1;i <= n;i++) Nd[dep[i]].push_back(i);
	for(int i = 0;i <= n;i++)
		if(Nd[i].size() && Nd[i + 1].size())
			Solve_set(Nd[i],Nd[i + 1]);
}