#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define U(x) ((int)x.size())
const int N=1e3+10;
mt19937 rnd(time(0));
#define gc getchar()
#define rd read()
inline int read(){
	int x=0,f=0; char c=gc;
	for(;c<'0'||c>'9';c=gc) f|=(c=='-');
	for(;c>='0'&&c<='9';c=gc) x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

int n,idx[N],a[N],b[N];
vector<int> cur;

inline int ask(int x,int y,int l){
	for(int i=1;i<=l;++i) b[idx[i]]=x;
	for(int i=l+1;i<=n;++i) b[idx[i]]=y;
	printf("0 "); for(int i=1;i<=n;++i) printf("%d ", b[i]); puts(""),fflush(stdout); return rd;
}
inline void over(){ printf("1 "); for(int i=1;i<=n;++i) printf("%d ", a[i]); puts(""),fflush(stdout); }

int fa[N],siz[N];
int find(int x){ return fa[x]==x?x:fa[x]=find(fa[x]); }

void sol(int l,int r,vector<int> vc){
	if(l==r){ for(int v:vc) a[idx[l]]=v; return; }
	int mid=l+r>>1; for(int v:vc) fa[v]=v,siz[v]=1; fa[n+1]=n+1,fa[n+2]=n+2,siz[n+1]=siz[n+2]=0;
	queue<int> q; for(int v:vc) q.push(v);
	while(U(q)>=2){
		int u=q.front(); q.pop();
		int v=q.front(); q.pop();
		int res=ask(u,v,mid);
		if(res==0) fa[u]=n+2,fa[v]=n+1,siz[n+1]+=siz[v],siz[n+2]+=siz[u]; 
		else if(res==1) fa[v]=u,siz[u]+=siz[v],q.push(u);
		else fa[u]=n+1,fa[v]=n+2,siz[n+1]+=siz[u],siz[n+2]+=siz[v];
	}
	if(U(q)){
		int u=q.front(); q.pop();
		fa[u]=(siz[n+1]<mid-l+1?n+1:n+2);
	}
	vector<int> v1,v2;
	for(int v:vc) if(find(v)==n+1) v1.pb(v);
	for(int v:vc) if(find(v)==n+2) v2.pb(v);
	sol(l,mid,v1),sol(mid+1,r,v2);
}

int main(){

	n=rd; for(int i=1;i<=n;++i) idx[i]=i,cur.pb(i);	
	shuffle(idx+1,idx+n+1,rnd);
	
	sol(1,n,cur),over();

	return 0;
}