#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(114514);
inline int randint(int l,int r) { return Rnd() % (r - l + 1) + l;}
std::vector<int> G[N];
void GetAns(int u,int v)
{
	G[u].push_back(v);G[v].push_back(u);
	answer(u,v);
}
int D[N][N];
void bfsdis(int *dis,int S)
{
	for(int i = 1;i <= n;i++) dis[i] = 1e9;
	dis[S] = 0;std::queue<int>Q;Q.push(S);
	while(!Q.empty())
	{
		int x = Q.front();Q.pop();
		for(auto y : G[x])
			if(dis[y] > dis[x] + 1)
				dis[y] = dis[x] + 1,
				Q.push(y);
	}
}
int DisSum(int v,const Set_nd &S)
{
	int res = 0;
	for(auto it : S) res += D[v][it];
	return res;
}
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)
			GetAns(A[0],it);
		return;
	}
	if(B.size() == 1)
	{
		// random_shuffle(A.begin(),A.end());
		for(auto it : A)
			if(ask(it,B) == 1) {GetAns(it,B[0]);break;}
		return;
	}
	Set_nd Poi,tmp = A;
	// random_shuffle(tmp.begin(),tmp.end());
	for(int i = 1;i < tmp.size();i++)
		std::swap(tmp[i],tmp[Rnd() % i]);
	int siz = std::max(1,randint(A.size() * 4 / 12,A.size() * 7 / 12));
	for(int i = 0;i < siz;i++)
		Poi.push_back(tmp[i]);
	// 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);

	for(auto it : A) dis[it] = DisSum(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);
	std::vector<Set_nd> tas,tbs;
	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;
		if(lb <= rb)
		{
			Set_nd ta,tb;
			for(int i = l;i <= r;i++) ta.push_back(A[i]);
			for(int i = lb;i <= rb;i++) tb.push_back(B[i]);
			tas.push_back(ta),tbs.push_back(tb);
		}
	}	
	for(int i = 0;i < tas.size();i++)
		Solve_set(tas[i],tbs[i]);
}
std::vector<int> Nd[N];
void solver(int _n,int A,int B)
{
	n = _n;
	int rt = Rnd() % n + 1;
	for(int i = 1;i <= n;i++)
		dep[i] = ask(i,Set_nd(1,rt));
	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]);
		for(auto it : Nd[i + 1])
			bfsdis(D[it],it);
	}
}