#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define endl '\n'
int n,ans[1009];
bool vis[1009];
struct dsu{
	int fa[1009];
	int getf(int u){return u==fa[u]?u:fa[u]=getf(fa[u]);}
}d;
void solve(int l,int r,vector<int> vec){
	if((int)vec.size()==1)return ans[l]=vec[0],void();
	int mid=l+r>>1;
	vector<int> v1,v2;
	for(int x:vec)d.fa[x]=x,vis[x]=0;
	random_shuffle(vec.begin(),vec.end());
	vector<int> t=vec;
	while((int)t.size()>1){
		int x=t.back();t.pop_back();
		int y=t.back();t.pop_back();
		cout<<"0 ";
		for(int i=1;i<=mid;i++)cout<<x<<' ';
		for(int i=mid+1;i<=n;i++)cout<<y<<' ';cout<<endl;
		cout.flush();
		int op;cin>>op;
		if(op==0){
			for(int p:vec)if(d.getf(p)==x)v2.push_back(p);
			for(int p:vec)if(d.getf(p)==y)v1.push_back(p);
		}else if(op==2){
			for(int p:vec)if(d.getf(p)==x)v1.push_back(p);
			for(int p:vec)if(d.getf(p)==y)v2.push_back(p);
		}else{
			t.push_back(x);
			d.fa[d.getf(y)]=d.getf(x);
		}
	}
	if(!t.empty()){
		for(int p:vec)if(d.getf(p)==t[0])
			if((int)v1.size()<mid-l+1)v1.push_back(p);
			else v2.push_back(p);
	}
	solve(l,mid,v1);solve(mid+1,r,v2);
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n;
	vector<int> tmp;
	for(int i=1;i<=n;i++)tmp.push_back(i);
	solve(1,n,tmp);
	cout<<"1 ";
	for(int i=1;i<=n;i++)cout<<ans[i]<<' ';cout<<endl;
	cout.flush();
	return 0;
}