/*
https://qoj.ac/problem/9432
*/
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mpr make_pair
#define rep(i,n) for(int i=1;i<=n;i++)
#define repe(i,l,r) for(int i=l;i<=r;i++)
#define FOR(i,r,l) for(int i=r;i>=l;i--)
#define pii pair<int,int>
#define ALL(v) v.begin(),v.end()
using namespace std;
void chkmax(int& x,int y){x=x>y? x:y;}
void chkmin(int& x,int y){x=x>y? y:x;}
const int N=1e3+5;
int n;
int ans[N],q[N];
int query(){
	printf("0 ");
	for(int i=1;i<=n;i++)printf("%d ",q[i]);
	printf("\n");
	cout.flush();
	int x;
	scanf("%d",&x);
	return x;
}
int fa[N];
bool flag[N];
int getfa(int x){
	return fa[x]=(fa[x]==x? x:getfa(fa[x]));
}
void solve(int l,int r,vector<int> v){
	if(l==r){
		ans[l]=v[0];
		return;
	}
	int mid=l+r>>1;
	vector<int> L,R,del;
	for(auto x:v)fa[x]=x;
	while((int)v.size()>1){
		random_shuffle(v.begin(),v.end());
		int x=v.back();v.pop_back();
		int y=v.back();v.pop_back();
		for(int i=1;i<=n;i++){
			q[i]=(i<=mid? x:y);
		}
		int val=query();
		if(val==0)flag[x]=1,flag[y]=0,L.push_back(y),R.push_back(x);
		else if(val==2)flag[x]=0,flag[y]=1,L.push_back(x),R.push_back(y);
		else v.push_back(x),del.push_back(y),fa[y]=x;
	}
	if(!v.empty()){
		int x=v[0],val;
		if(!L.empty()){
			int y=L[0];
			for(int i=1;i<=n;i++){
				q[i]=(i<=mid? x:y);
			}
			val=query();
			if(val==0)R.push_back(x),flag[x]=1;
			else L.push_back(x),flag[x]=0;
		}
		else{
			int y=R[0];
			for(int i=1;i<=n;i++){
				q[i]=(i<=mid? x:y);
			}
			val=query();
			if(val==0)R.push_back(x),flag[x]=1;
			else L.push_back(x),flag[x]=0;
		}
	}
	for(auto y:del){
		int x=getfa(y);
		if(flag[x])R.push_back(y);
		else L.push_back(y);
	}
	if(!L.empty())solve(l,mid,L);
	if(!R.empty())solve(mid+1,r,R);
	return;
}
signed main(){
	scanf("%d",&n);
	if(n==1){
		puts("1 1");
		return 0;
	}
	vector<int> v;
	for(int i=1;i<=n;i++)v.push_back(i);
	solve(1,n,v);
	printf("1 ");
	for(int i=1;i<=n;i++)printf("%d ",ans[i]);cout.flush();
	return 0;
}