#include<bits/stdc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long long
using namespace std;
const int N=1e3+5;
int n;
int a[N],bel[N],vs[N];
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
inline void solve(vector<int>id,vector<int>col,bool op){
	if(id.size()==1)return a[id[0]]=(op?1:col[0]),void();
	const int lsz=(id.size()+1)/2,rsz=id.size()-lsz;
	vector<int>lid,rid;
	int lop=0,rop=0;
	for(int j=0;j<lsz;++j)lid.emplace_back(id[j]);
	for(int j=lsz;j<lsz+rsz;++j)rid.emplace_back(id[j]);
	for(auto j:lid)bel[j]=1;
	for(auto j:rid)bel[j]=2;
	vector<int>ls,rs;
	vector<vector<int>>E;
	for(auto i:col)vs[i]=0;
	if(op){
		for(;;){
			int x=col[rng()%col.size()];
			if(vs[x])continue;
			cout<<"0 ";
			for(int i=1;i<=n;++i)
				if(bel[i]==1)cout<<x<<' ';
				else cout<<"1 ";
			cout<<endl;
			int v;cin>>v;
			if(v==0){
				lop=1;
				rs.emplace_back(x);
				for(auto i:col)if(i!=x&&!vs[i])E.emplace_back(vector<int>({i}));
				else if(vs[i])ls.emplace_back(i);
				break;
			}
			if(v==2){
				rop=1;
				ls.emplace_back(x);
				for(auto i:col)if(i!=x&&!vs[i])E.emplace_back(vector<int>({i}));
				else if(vs[i])rs.emplace_back(i);
				break;
			}
			vs[x]=1;
		}
	}
	else for(auto i:col)E.emplace_back(vector<int>({i}));
	for(int k=1;!E.empty();k*=2){
		shuffle(E.begin(),E.end(),rng);
		int p=0;
		vector<vector<int>>nxt;
		for(;p+1<E.size();p+=2){
			int c=E[p][0],d=E[p+1][0];
			if(ls.size()+k+lop>lsz||rs.size()+k+rop>rsz){
				nxt.emplace_back(E[p]);
				for(auto j:E[p+1])nxt.back().emplace_back(j);
				continue;
			}
			cout<<"0 ";
			for(int j=1;j<=n;++j)
				if(bel[j]==1)cout<<c<<' ';
				else if(bel[j]==2)cout<<d<<' ';
				else cout<<"1 ";
			cout<<endl;
			int v;cin>>v;
			if(op)++v;
			if(v==1){
				for(auto j:E[p])rs.emplace_back(j);
				for(auto j:E[p+1])ls.emplace_back(j);
			}
			else if(v==2){
				nxt.emplace_back(E[p]);
				for(auto j:E[p+1])nxt.back().emplace_back(j);
			}
			else{
				for(auto j:E[p])ls.emplace_back(j);
				for(auto j:E[p+1])rs.emplace_back(j);
			}
		}
		if(E.size()&1){
			if((lsz-ls.size()-lop)%(k*2)){
				for(auto j:E[p])ls.emplace_back(j);
			}
			else{
				for(auto j:E[p])rs.emplace_back(j);
			}
		}
		E=nxt;
	}
	for(auto j:lid)bel[j]=0;
	for(auto j:rid)bel[j]=0;
	solve(lid,ls,lop);
	solve(rid,rs,rop);
}
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin>>n;
	if(n==1)return cout<<"1 1\n",0;
	vector<int>col,id;
	for(int c=2;c<=n;++c)col.emplace_back(c);
	for(int i=1;i<=n;++i)id.emplace_back(i);
	solve(id,col,1);
	cout<<'1';
	for(int i=1;i<=n;++i)cout<<' '<<a[i];
	return 0;
}
/*
2 8 6 7 5 3 1 4
*/