#include <bits/stdc++.h>
#define time(x) x
#ifdef zhr_debug
#define debug printf
#else
void debug(const char* s,...){}
#endif
using namespace std;
mt19937 rnd(time(0));
void freopen(string file){freopen((file+".in").c_str(),"r",stdin);freopen((file+".out").c_str(),"w",stdout);}
int n,tot;
int _[1020];
int ans[1020];
int ask[1020];
int query()
{
	tot++;
	printf("0 ");
	for(int i=1;i<=n;i++) printf("%d ",ask[i]);
	printf("\n");fflush(stdout);
	int ret=0;
	cin>>ret;
	return ret;
}
void solve(int l,int r,vector<int> &vec)
{
	assert(vec.size()==r-l+1);
	if(l==r)
	{
		ans[l]=vec[0];
		return;
	}
	vector<int> L,R,tmp;
	int mid=(l+r)>>1;
	shuffle(vec.begin(),vec.end(),rnd);
	for(int x:vec)
	{
		if(L.size()==mid-l+1){R.push_back(x);continue;}
		if(R.size()==r-mid){L.push_back(x);continue;}
		if(tmp.empty()){tmp.push_back(x);continue;}
		fill(ask+1,ask+n+1,tmp[0]);
		fill(ask+1,ask+mid+1,x);
		int res=query();
		if(res==0)
		{
			R.push_back(x);
			for(int v:tmp) L.push_back(v);
			tmp.clear();
		}
		if(res==1) tmp.push_back(x);
		if(res==2)
		{
			L.push_back(x);
			for(int v:tmp) R.push_back(v);
			tmp.clear();
		}
	}
	if(L.size()<mid-l+1) for(int v:tmp) L.push_back(v);
	if(R.size()<r-mid) for(int v:tmp) R.push_back(v);
	solve(l,mid,L);
	solve(mid+1,r,R);
}
int main()
{
	srand(time(0));
	cin>>n;
	for(int i=1;i<=n;i++) _[i]=i;
	random_shuffle(_+1,_+n+1);
	vector<int> vec;
	for(int i=1;i<=n;i++) vec.push_back(i);
	solve(1,n,vec);
	printf("1 ");
	for(int i=1;i<=n;i++) printf("%d ",ans[i]);
	printf("\n");fflush(stdout);
	cerr<<tot<<endl;
}