#include<cstdio>
#include<vector>
#include "interactive.h"
using namespace std;
#define fo(i,a,b) for(int i=a;i<=b;++i)
#define fe(i,a,b) for(int i=a;i>=b;--i)
#define ll long long
const int N=500+5;
int d[N][N];
int query(vector<int>p);
int make1(int n,int x,int y,int z)
{
	vector<int>a;
	a.resize(n),a[0]=x,a[1]=y,a[2]=z;
	int cot=0;
	fo(i,3,n-1)
	{
		do
		{
			++cot;
		}while(cot==x||cot==y||cot==z);
		a[i]=cot;
	}
	return query(a);
}
void ins(int u,int v){d[u][v]=d[v][u]=1;}
vector<int>solve(int n)
{
	fo(i,2,n-1) fo(j,i+1,n)
	{
		int c1=make1(n,1,i,j)-make1(n,i,1,j),c2=make1(n,1,j,i)-make1(n,j,1,i);
		if(c1==0)
		{
			if(c2<0) ins(1,i);
			if(c2>0) ins(i,j),ins(1,j);
		}
		else
			if(c1<0)
			{
				ins(1,j);
				if(c2) ins(1,i);
			}
			else
			{
				ins(i,j);
				if(!c2) ins(1,i);
			}
	}
	int u=0;
	fo(i,1,n)
	{
		int s=0;
		fo(j,1,n) s+=d[i][j];
		if(s==1)
		{
			u=i;
			break;
		}
	}
	int fa=0,cot=0;
	vector<int>a;
	a.resize(n);
	while(cot<n)
	{
		a[cot++]=u;
		fo(v,1,n) if(d[u][v]&&v!=fa)
		{
			fa=u,u=v;
			break;
		}
	}
	return a;
}