/*
I know this sky loves you
いずれ全て
変わってしまったって
空は青いだろうよ
*/

# include <bits/stdc++.h>

const int N=100010,INF=0x3f3f3f3f;

inline int read(void){
	int res,f=1;
	char c;
	while((c=getchar())<'0'||c>'9')
		if(c=='-') f=-1;
	res=c-48;
	while((c=getchar())>='0'&&c<='9')
		res=res*10+c-48;
	return res*f;
}
int n;
std::mt19937 rng(0);
int p[N];

typedef std::vector <int> vec;

vec ban;

inline int query(vec arr){
	printf("0 ");
	for(auto v:arr) printf("%d ",v);
	puts("");
	fflush(stdout);
	return read();
}

inline void guess(vec arr){
	printf("1 ");
	for(auto v:arr) printf("%d ",v);
	puts("");
	fflush(stdout);
	return;
}

bool loc[N];

vec rem;
vec ans;

inline void get_pos(void){
	vec().swap(rem);
	for(int i=0;i<n;++i) if(!loc[i]) rem.push_back(i);
	return;
}

inline void double_query(int lu,int ru,int lv,int rv,vec pos,int u,int v){
//	printf("double_query lu = %d ru = %d lv = %d rv = %d u = %d v = %d\n",lu,ru,lv,rv,u,v);
	
	if(lu==ru&&lv==rv)
		return ans[pos[lu]]=u,ans[pos[lv]]=v,loc[pos[lu]]=loc[pos[lv]]=true,void();
	
	int midu=(lu+ru)>>1;
	int midv=(lv+rv)>>1;
	
	vec arr=ban;
	
	std::vector <int> lp,rp;
	
	for(int i=lu;i<=midu;++i) arr[pos[i]]=u,lp.push_back(i);
	for(int i=midu+1;i<=ru;++i) rp.push_back(i);
	for(int i=lv;i<=midv;++i) arr[pos[i]]=v,lp.push_back(i);
	for(int i=midv+1;i<=rv;++i) rp.push_back(i);
	
	int ret=query(arr);
	
	if(ret==2){
		return double_query(lu,midu,lv,midv,pos,u,v);
	}else if(ret==0) return double_query(midu+1,ru,midv+1,rv,pos,u,v);
	
	arr=ban,vec().swap(lp),vec().swap(rp);

	for(int i=lu;i<=midu;++i) rp.push_back(i);
	for(int i=midu+1;i<=ru;++i) arr[pos[i]]=u,lp.push_back(i);
	for(int i=lv;i<=midv;++i) arr[pos[i]]=v,lp.push_back(i);
	for(int i=midv+1;i<=rv;++i) rp.push_back(i);

	ret=query(arr);
	if(ret==2) return double_query(midu+1,ru,lv,midv,pos,u,v);
	return double_query(lu,midu,midv+1,rv,pos,u,v);
}

inline void query(vec pos,int u,int v){
	int len=pos.size();
	
//	printf("u = %d v = %d\n",u,v);
//	for(auto v:pos) printf("remain: %d",v); puts("");
	
	vec arr=ban;
	for(int i=0;i<len/2;++i) arr[pos[i]]=u;
	for(int i=len/2;i<len;++i) arr[pos[i]]=v;
	int ret=query(arr);
	if(ret==2||ret==0){
		if(ret==0) std::swap(u,v);
		return double_query(0,len/2-1,len/2,len-1,pos,u,v);
	}else{
		for(int i=0;i<len/2;++i) arr[pos[i]]=ban[pos[i]];
		int nw=query(arr);
		vec np;
		if(nw==1) for(int i=len/2;i<len;++i) np.push_back(pos[i]);
		else for(int i=0;i<len/2;++i) np.push_back(pos[i]);
		return query(np,u,v);
	}
	assert(0);
	return;
}

int main(void){
	n=read(); ans=vec(n,0);
	
	if(n==1) guess(vec(1,1)),exit(0);
	
	vec arr;
	arr.resize(n); std::iota(arr.begin(),arr.end(),1);
	
	do{
		std::shuffle(arr.begin(),arr.end(),rng);
	}while(query(arr)!=0);
	
//	printf("yes!\n");
//	puts("correct"); return 0;
	
	ban=arr;
	
	vec val(n); std::iota(val.begin(),val.end(),1);
	
	std::shuffle(val.begin(),val.end(),rng);
	
	for(int i=0;i<n;i+=2){
		get_pos();
		
		if(i==n-1) ans[rem[0]]=val[i];
		else{
			query(rem,val[i],val[i+1]);
		}
	}
	guess(ans);

	return 0;
}