#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<random>
#include<algorithm>
#define N 1000
using namespace std;
mt19937 RAND(random_device{}());
int n,dp[N+1],sp[N+1],delta[N+1],ans[N+1];
int query()
{
	int d;
	cout<<0<<' ';
	for (int i=1;i<=n;++i) cout<<delta[i]<<' ';
	cout<<endl;
	fflush(stdout);
	cin>>d;
	return d;
}
void solve(int l,int r,vector<int>p)
{
	if (l==r)
	{
		ans[l]=p[0];
		return;
	}
	int d,mid=(l+r)>>1,cnt=mid-l+1,cnt2=r-mid;
	vector<int>A;
	vector<int>B;
	shuffle(p.begin(),p.end(),RAND);
	for (int i=0;i+1<p.size();i+=2)
	{
		for (int j=1;j<=n;++j) delta[j]=sp[j];
		for (int j=l;j<=mid;++j) delta[j]=p[i];
		for (int j=mid+1;j<=r;++j) delta[j]=p[i+1];
		d=query();
		if (!d) A.push_back(p[i+1]),B.push_back(p[i]),cnt--,cnt2--;
		else if (d==2) A.push_back(p[i]),B.push_back(p[i+1]),cnt--,cnt2--;
		else
		{
			for (int j=mid+1;j<=r;++j) delta[j]=sp[j];
			if (cnt2==1) A.push_back(p[i]),A.push_back(p[i+1]),cnt-=2;
			else if (cnt==1) B.push_back(p[i]),B.push_back(p[i+1]),cnt2-=2;
			else if (query()) A.push_back(p[i]),A.push_back(p[i+1]),cnt-=2;
			else B.push_back(p[i]),B.push_back(p[i+1]),cnt2-=2;
		}
		if (!cnt)
		{
			for (int j=i+2;j<p.size();++j) B.push_back(p[j]);
			break;
		}
		if (!cnt2)
		{
			for (int j=i+2;j<p.size();++j) A.push_back(p[j]);
			break;
		}
	}
	solve(l,mid,A),solve(mid+1,r,B);
	return;
}
int main()
{
	cin>>n;
	if (n==1)
	{
		cout<<1<<' '<<1<<endl;
		fflush(stdout);
		return 0;
	}
	while (1)
	{
		for (int i=1;i<=n;++i) delta[i]=RAND()%n+1;
		if (!query()) break;
	}
	for (int i=1;i<=n;++i) sp[i]=delta[i];
	vector<int>p;
	for (int i=1;i<=n;++i) p.push_back(i);
	solve(1,n,p);
	cout<<1<<' ';
	for (int i=1;i<=n;++i) cout<<ans[i]<<' ';
	cout<<endl;
	fflush(stdout);
	return 0;
}