#include <bits/stdc++.h>
using namespace std;
mt19937 rng(time(NULL));
int rint(int l,int r){return l+rng()%(r-l+1);}
int n,a[1005],b[1005];
int ask(){
	printf("0 ");
	for(int i=1;i<=n;++i) printf("%d ",b[i]);
	printf("\n");
	fflush(stdout);
	int res;
	scanf("%d",&res);
	return res;
}
void solve(int l,int r){
	if(l==r) return;
	// cerr<<"solve "<<l<<" "<<r<<endl;
	for(int i=1;i<l;++i) b[i]=a[l];
	for(int i=r+1;i<=n;++i) b[i]=a[l];
	int mid=l+r>>1;
	vector<int> vc;
	for(int i=l;i<=r;++i) vc.push_back(a[i]);
	for(int i=1;i<(int)vc.size();++i) swap(vc[i],vc[rng()%(i+1)]);
	int cur=vc[0];
	vector<int> tmp;
	int li=l-1,ri=mid;
	for(int i=1;i<(int)vc.size();++i){
		if(!cur){
			if(i+1<(int)vc.size()){
				cur=vc[i];
				continue;
			}else{
				if(li<mid) a[++li]=vc[i];
				else a[++ri]=vc[i];
				break;
			}
		}
		for(int j=l;j<=mid;++j) b[j]=cur;
		for(int j=mid+1;j<=r;++j) b[j]=vc[i];
		// cerr<<"? "<<cur<<" "<<vc[i]<<endl;
		int res=ask();
		if(res==2){
			a[++li]=cur;
			for(auto x:tmp) a[++li]=x;
			a[++ri]=vc[i];
			tmp.clear();
			cur=0;
		}else if(res==0){
			a[++ri]=cur;
			for(auto x:tmp) a[++ri]=x;
			a[++li]=vc[i];
			tmp.clear();
			cur=0;
		}else{
			tmp.push_back(cur);
			cur=vc[i];
		}
	}
	if(cur){
		if(li<mid){
			a[++li]=cur;
			for(auto x:tmp) a[++li]=x;
		}else{
			a[++ri]=cur;
			for(auto x:tmp) a[++ri]=x;
		}
	}
	// cerr<<"li="<<li<<" ri="<<ri<<endl;
	// for(int i=l;i<=r;++i) cerr<<a[i]<<" ";
	// cerr<<endl;
	solve(l,mid);
	solve(mid+1,r);
}
signed main(){
	scanf("%d",&n);
	iota(a+1,a+n+1,1);
	solve(1,n);
	printf("1 ");
	for(int i=1;i<=n;++i) printf("%d ",a[i]);
	printf("\n");
	fflush(stdout);
	return 0;
}