#include "sonlib.h"
// what is matter? never mind.
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
 
#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
typedef vector<pii>vpii;

#define maxn 1000005
#define inf 0x3f3f3f3f

int n;
int e[505][505];
int vis[505],vis2[505],ok[505];

int mov(int d,int E=-1){
	int res=MoveProbe(d);
	if(E!=-1) assert(res==E);
	return res;
}
void adde(int u,int v){
	e[u][v]=e[v][u]=1;
	ok[u]=ok[v]=1;
}
void no(int u,int v){
	e[u][v]=e[v][u]=-1;
}

void tri(int a,int b,int c);

void work(int u,int beg){
	if(vis[u])return;
	vis[u]=vis2[u]=1;
	For(i,1,n){
		if(ok[i]||e[u][i]==-1)continue;
		if(!mov(i)) no(u,i);
		else{
			adde(u,i);
			tri(i,u,beg);
			mov(u);
		}
	}
}
void tri(int a,int b,int c){
	if(vis2[a])return;
	vis2[a]=1;
	mov(b,0); work(b,a);
	mov(a,1);
	mov(c,0);
	if(mov(b)){
		// triangle
		adde(a,c);
		mov(a,0),work(a,b);
		mov(b,1),mov(c,0),work(c,b);
		mov(a,1);
		return;
	}
	else mov(a,1),no(a,c);
	vis[a]=vis2[a]=1;
	// query out all (a,i)
	For(i,1,n){
		if(ok[i]||e[a][i]==-1)continue;
		mov(i,0);
		if(mov(c)){
			adde(a,i),adde(c,i);
			mov(i,0); work(i,a);
			mov(a,1);
			continue;
		}
		if(mov(b)){
			adde(a,i),adde(b,i),no(c,i);
			mov(i,0),work(i,b);
			mov(a,1);
			continue;
		}
		if(mov(c)){
			no(a,i);
			tri(c,b,a);
			mov(b),mov(a);
			continue;
		}
		adde(a,i),no(b,i),no(c,i);
		work(i,a);
		mov(a);
	}
	if(!vis2[c]){
		mov(b,0),mov(c,1);
		tri(c,b,a);
		mov(b,0),mov(a,1);
	}
}

bool done[maxn];
void dfs(int u){
	Examine(); done[u]=1;
	For(i,1,n) if(!done[i] && e[u][i]==1) mov(i),dfs(i),mov(u); 
}

vi path(){
	vi o;
	For(i,0,n-1){
		For(j,0,n-2){
			int u=(i+j)%(n-2)+2;
			if(mov(u)){
				vi o;
				o.pb(1);
				For(k,0,j)o.pb((i+k)%(n-2)+2);
				reverse(o.begin(),o.end());
				return o;
			}
		}
		mov(1,1);
	}
	return {};
} 

void end_tri(int a,int b,int c){
	adde(a,b),adde(b,c);
	tri(a,b,c);
	dfs(a); exit(0);
}

vi p;

signed main()
{
	n=GetN();
	p=path();
	if(!p.size()){
		For(i,2,n)adde(1,i);
		dfs(1); exit(0);
	}
	int s=p[0],t=p.back();
	p.pop_back(),p.erase(p.begin());
	while(p.size()>1){
		bool close=0;
		For(i,0,(int)p.size()-1){
			if(mov(p[i])){
				t=s,s=p[i];
				p.resize(i);
				reverse(p.begin(),p.end());
				close=1;
				break;
			}
		}
		if(close)continue;
		mov(t,1);
		swap(s,t),reverse(p.begin(),p.end());
		for(auto x:p){
			mov(x,0);
			if(mov(t)) end_tri(s,x,t);
		}
	}
	end_tri(s,p[0],t);
//	if(GetSubtask()!=2)exit(233);
//	adde(1,2),adde(2,3);
//	tri(1,2,3);
//	dfs(1);
	return 0;
}