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

const int N = 1e3 + 5;
typedef std::vector<int> Set_nd;
typedef std::pair<Set_nd,int> psi;
#define fi first
#define se second
#define mkp make_pair
int n;
inline int find_rt(Set_nd S)
{
	int res = 1e9,k = -1;
	for(auto it : S)
	{
		int val = ask(it,S);
		if(val < res) res = val,k = it;
	}
	assert(k != -1);
	return k;
}
inline Set_nd find_neighbor(Set_nd S,int rt)
{
	Set_nd res,self;self.push_back(rt);
	for(auto it : S)
		if(it != rt && ask(it,self) == 1) res.push_back(it);
	return res;
}
inline void Merge(Set_nd &a,const Set_nd &b)
{
	for(auto it : b) a.push_back(it);
}
inline void Add_nd(std::vector<psi> &Sets,int v,int rt)
{
	int siz = Sets.size();
	Set_nd Srt;Srt.push_back(rt);
	int vrt = ask(v,Srt);

	int now = 0,nowSrt = 0,nowSv = 0; // sum (S,rt)
	int nowsiz = 0;
	for(int i = (int)log2(siz);i >= 0;i--)
	{
		if(now + (1 << i) >= siz) continue;
		// now + 1,now + (1 << i)
		int nxt = now | (1 << i);
		int nxtSv = nowSv;
		Set_nd nowS;
		for(int j = now + 1;j <= nxt;j++)
			Merge(nowS,Sets[j].fi);
		nxtSv += ask(v,nowS);
		int nxtSrt = nowSrt;
		for(int j = now + 1;j <= nxt;j++)
			nxtSrt += Sets[j].se;
		int nxtsiz = nowsiz;
		for(int j = now + 1;j <= nxt;j++)
			nxtsiz += Sets[j].fi.size();
		if(nxtSv == nxtSrt + nxtsiz * vrt) 
		{
			now = nxt;
			nowSv = nxtSv;
			nowsiz = nxtsiz;
			nowSrt = nxtSrt;
		}
	}
	assert(now + 1 < siz);
	Sets[now + 1].fi.push_back(v);
	Sets[now + 1].se += vrt;
}
void Divide(Set_nd S)
{
	int rt = find_rt(S);
	std::vector<int> nei = find_neighbor(S,rt);
	for(auto it : nei) answer(rt,it);
	std::vector<psi> Sets;
	
	for(auto it : nei) { Sets.push_back(mkp(Set_nd(1,it),1));}
	static int deled[N];
	for(int i = 1;i <= n;i++) deled[i] = 0;
	deled[rt] = 1;
	for(auto it : nei) deled[it] = 1;
	for(auto it : S) if(!deled[it]) Add_nd(Sets,it,rt);
	for(auto it : Sets) Divide(it.fi);
}
void solver(int _n,int A,int B)
{
	n = _n;
	Set_nd init;
	for(int i = 1;i <= n;i++) init.push_back(i);
	Divide(init);
}