#include <bits/stdc++.h>
using namespace std;
int n;
int fa[1005],siz[1005],q[1005],ans[1005];
vector<int>v;
int find(int x){
	return fa[x]==x?x:find(fa[x]);
}
void merge(int x,int y){
	x=find(x),y=find(y);
	if(siz[x]>siz[y])
		swap(x,y);
	fa[x]=y;
	siz[y]+=siz[x];
}
int ask(){
	cout<<"0 ";
	for(int i=1;i<=n;i++){
		cout<<q[i]<<" ";
	}
	cout<<endl;
	fflush(stdout);
	int res;
	cin>>res;
	return res;
}
void calc(int l,int r,vector<int> v){
	if(l==r){
		ans[l]=v[0];
		return;
	}
	for(int x:v){
		fa[x]=x;
		siz[x]=1;
	}
	vector<int>vl,vr;
	vector<int>lin=v;
	int x,y,mid=l+r>>1;
	while(lin.size()>1){
		x=lin.back();
		lin.pop_back();
		y=lin.back();
		lin.pop_back();
		for(int i=1;i<=mid;i++){
			q[i]=x;
		}
		for(int i=mid+1;i<=n;i++){
			q[i]=y;
		}
		int res=ask();
		if(res==2){
			int findx=find(x),findy=find(y);
			for(int u:v){
				int findu=find(u);
				if(findu==findx)
					vl.emplace_back(u);
				if(findu==findy)
					vr.emplace_back(u);
			}
		}
		else if(res==0){
			int findx=find(x),findy=find(y);
			for(int u:v){
				int findu=find(u);
				if(findu==findx)
					vr.emplace_back(u);
				if(findu==findy)
					vl.emplace_back(u);
			}
		}
		else{
			merge(x,y);
			lin.emplace_back(y);
		}
	}
	if(lin.size()){
		int u=lin[0],findu=find(u);
		for(int x:v){
			if(find(x)==findu){
				if(vl.size()<mid-l+1)
					vl.emplace_back(x);
				else
					vr.emplace_back(x);
			}
		}
	}
	calc(l,mid,vl);
	calc(mid+1,r,vr);
}
signed main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		v.emplace_back(i);
	}
	calc(1,n,v);
	cout<<"1 ";
	for(int i=1;i<=n;i++){
		cout<<ans[i]<<" ";
	}
	fflush(stdout);
	return 0;
}
//Skadi_H