#include<bits/stdc++.h>
using namespace std;
inline int read()
{
	int sum=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)){if(ch=='-')f*=-1;ch=getchar();}
	while(isdigit(ch)){sum=sum*10+ch-48;ch=getchar();}
	return sum*f;
}
int a[1005];
int n;
vector<int> g[4005];
inline int ask(int l,int mid,int r,int x,int y)
{
	cout<<0<<" ";
	for(int i=1;i<=n;i++)
	{
		if(l<=i&&i<=mid) cout<<x<<" ";
		else cout<<y<<" ";
	}
	cout<<endl;
	return read();
}
inline void solve(int num,int l,int r)
{
	if(l==r) return;
	int mid=(l+r)>>1;
	int las=0;
	int lson=num<<1;
	int rson=num<<1|1;
	
	for(int i=1;i<g[num].size();i++)
	{
		int x=ask(l,mid,r,g[num][las],g[num][i]);
		if(x==2) 
		{
			for(int j=las;j<=i-1;j++) g[lson].push_back(g[num][j]);
			g[rson].push_back(g[num][i]);
			las=i+1;i++;
		}
		if(x==0)
		{
			for(int j=las;j<=i-1;j++) g[rson].push_back(g[num][j]);
			g[lson].push_back(g[num][i]);
			las=i+1;i++;
		}
	}
	if(g[lson].size()!=mid-l+1)
		for(int j=las;j<g[num].size();j++) g[lson].push_back(g[num][j]);
	else
		for(int j=las;j<g[num].size();j++) g[rson].push_back(g[num][j]);
	solve(lson,l,mid);
	solve(rson,mid+1,r);
}
inline void output(int num,int l,int r)
{
	if(l==r) {cout<<g[num][0]<<" ";return;}
	int mid=(l+r)>>1;
	int lson=num<<1;
	int rson=num<<1|1;
	output(lson,l,mid);
	output(rson,mid+1,r);
}
signed main()
{
	n=read();
	for(int i=1;i<=n;i++) g[1].push_back(i);
	solve(1,1,n);
	cout<<1<<" ";
	output(1,1,n);
	cout<<endl;
	return 0;
}