#include<bits/stdc++.h>
using namespace std;
const int MAXN=1005;
int n,a[MAXN],p[MAXN];
int qry() {
	cout<<"0 "; for(int i=1;i<=n;++i) cout<<a[i]<<" "; cout<<endl;
	int x; cin>>x; return x;
}
mt19937 rnd(time(0));
void solve(int l,int r,vector<int>&v) {
	if(l==r) return p[l]=v[0],void();
	int mid=(l+r)>>1;
	shuffle(v.begin(),v.end(),rnd);
	vector <int> lv,rv,st;
	for(int x:v) {
		if((int)lv.size()==mid-l+1) { rv.push_back(x); continue; }
		if((int)rv.size()==r-mid) { lv.push_back(x); continue; }
		if(st.empty()) { st.push_back(x); continue; }
		fill(a+1,a+n+1,st[0]);
		fill(a+l,a+mid+1,x);
		int z=qry();
		if(z==0) {
			rv.push_back(x);
			lv.insert(lv.end(),st.begin(),st.end());
			st.clear();
		} else if(z==2) {
			lv.push_back(x);
			rv.insert(rv.end(),st.begin(),st.end());
			st.clear();
		} else st.push_back(x);
	}
	if((int)lv.size()<mid-l+1) lv.insert(lv.end(),st.begin(),st.end());
	else rv.insert(rv.end(),st.begin(),st.end());
	solve(l,mid,lv),solve(mid+1,r,rv);
}
signed main() {
	cin>>n;
	vector <int> v;
	for(int i=1;i<=n;++i) v.push_back(i);
	solve(1,n,v);
	cout<<"1 "; for(int i=1;i<=n;++i) cout<<p[i]<<" "; cout<<endl;
	return 0;
}