#include <cstdio>
#include <bitset>
#include <random>
#include <cassert>
#include <algorithm>
using namespace std;
mt19937 rng(random_device{}());
int read(){
	char c=getchar();int x=0;
	while(c<48||c>57) c=getchar();
	do x=x*10+(c^48),c=getchar();
	while(c>=48&&c<=57);
	return x;
}
const int N=1003;
bitset<N> a[N];int c[N];
int n,cnt;
int p[N];
int w[N],s[N];
int ask(){
	int res=0;
	++cnt;
#ifdef LOCAL
	for(int i=1;i<=n;++i) res+=(p[i]==w[i]);
#else
	putchar('0');
	for(int i=1;i<=n;++i) printf(" %d",w[i]);
	putchar('\n');fflush(stdout);
	res=read();
#endif
	return res;
}
int stk[N],tp;
void proc(){
	for(int i=1;i<=n;++i) w[i]=rng()%n+1;
	while(ask()) for(int i=1;i<=n;++i) w[i]=rng()%n+1;
}
int res[N];
vector<int> lis[N];
void solve(int l,int r,vector<int> vc){
	if(l==r){res[l]=vc.back();return;}
	shuffle(vc.begin(),vc.end(),rng);
	vector<int> lef,rig;
	int mid=(l+r)>>1;
	for(int x:vc) lis[x].emplace_back(x);
	while(vc.size()>1){
		int x=vc.back();vc.pop_back();
		int y=vc.back();vc.pop_back();
		for(int i=1;i<=n;++i) w[i]=s[i];
		for(int i=l;i<=mid;++i) w[i]=x;
		for(int i=mid+1;i<=r;++i) w[i]=y;
		int v=ask();
		if(v==0){
			for(int t:lis[x]) rig.emplace_back(t);
			for(int t:lis[y]) lef.emplace_back(t);
			lis[x].clear();lis[y].clear();
			continue;
		}
		if(v==2){
			for(int t:lis[x]) lef.emplace_back(t);
			for(int t:lis[y]) rig.emplace_back(t);
			lis[x].clear();lis[y].clear();
			continue;
		}
		if(lis[x].size()<lis[y].size()) swap(x,y);
		for(int t:lis[y]) lis[x].emplace_back(t);
		lis[y].clear();
		vc.emplace_back(x);
		if((int)lef.size()==mid-l+1){
			while(!vc.empty()){
				for(int t:lis[vc.back()]) rig.emplace_back(t);
				lis[vc.back()].clear();
				vc.pop_back();
			}
			break;
		}
		if((int)rig.size()==r-mid){
			while(!vc.empty()){
				for(int t:lis[vc.back()]) lef.emplace_back(t);
				lis[vc.back()].clear();
				vc.pop_back();
			}
			break;
		}
	}
	while(!vc.empty()){
		int x=vc.back();vc.pop_back();
		for(int i=1;i<=n;++i) w[i]=s[i];
		for(int i=l;i<=mid;++i) w[i]=x;
		if(ask()) for(int t:lis[x]) lef.emplace_back(t);
		else for(int t:lis[x]) rig.emplace_back(t);
		lis[x].clear();
	}
	solve(l,mid,lef);
	solve(mid+1,r,rig);
}
int main(){
	n=read();
#ifdef LOCAL
	for(int i=1;i<=n;++i) p[i]=i;
	shuffle(p+1,p+n+1,rng);
#endif
	if(n==1){
		puts("1 1");
		return 0;
	}
	proc();
	vector<int> init;
	for(int i=1;i<=n;++i) s[i]=w[i],init.emplace_back(i);
	solve(1,n,init);
	putchar('1');
	for(int i=1;i<=n;++i) printf(" %d",res[i]);
	putchar('\n');
	fflush(stdout);
	fprintf(stderr,"%d\n",cnt);
#ifdef LOCAL
	for(int i=1;i<=n;++i) assert(res[i]==p[i]);
#endif
	return 0;
}