#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pii;
//#define DEBUG

#ifdef DEBUG
const ll N = 1010;
#endif
#ifndef DEBUG
const ll N = 1010;
#endif
ll a[N], b[N], buf[N];
ll n;
ll query()
{
	cout << "0 ";
	for(ll i=0; i<n; i++)
		cout << buf[i] << ' ';
	cout << '\n';
	ll tmp;
	cout.flush();
	cin >> tmp;
	return tmp;
}
inline void brush(ll lb, ll rb, ll x)
{
	for(ll i=lb; i<rb; i++)
		buf[i] = x;
}

void solve(ll lb, ll rb)
{
	if(rb - lb <= 1) return;
	
	for(ll i=lb; i<rb; i++)
		b[i] = a[i];
	ll k1 = lb, k2 = rb-1;	
	ll group = 1, pos1 = rb;
	ll mid = (lb + rb) >> 1;
	brush(0, lb, b[lb]);
	brush(rb, n, b[lb]);
	
	while(pos1 > lb)
	{
		ll pos2 = lb;
		ll i;
		for(i=lb; i+group<pos1; i+=group*2)
		{
			brush(lb, mid, b[i]);
			brush(mid, rb, b[i+group]);
			switch(query())
			{
				case 0:
					for(ll j=group; j<2*group; j++)
					{
						a[k1] = b[i+j]; 
						k1++;
					}
					for(ll j=0; j<group; j++)
					{
						a[k2] = b[i+j]; 
						k2--;
					}
					break;
				case 2:
					for(ll j=0; j<group; j++)
					{
						a[k1] = b[i+j]; 
						k1++;
					}
					for(ll j=group; j<2*group; j++)
					{
						a[k2] = b[i+j]; 
						k2--;
					}
					break;
				case 1:
					for(ll j=0; j<2*group; j++)
					{
						b[pos2] = b[i+j];
						pos2++;
					}
					break;
					
			}
		}
		
		if(i < pos1)
		{
			if((mid - k1) / group % 2) for(; i<pos1; i++)
			{
				a[k1] = b[i]; 
				k1++;
			}
			else for(; i<pos1; i++)
			{
				a[k2] = b[i]; 
				k2--;
			}
		}
		pos1 = pos2;
		group <<= 1;
	}
	
	solve(lb, mid);
	solve(mid, rb);
}

int main()
{
//	#ifndef DEBUG
//	ios::sync_with_stdio(false);
//	cin.tie(0);
//	cout.tie(0);
//	#endif
	#ifdef DEBUG
	freopen("1.txt", "r", stdin);
	#endif
	srand(time(NULL));
	cin >> n;
//	const ll aa[8] = {8, 7, 6, 2, 5, 1, 3, 4};
	for(ll i=0; i<n; i++) a[i] = i+1;
	random_shuffle(a, a+n);
	
	solve(0, n);
	
	cout << "1 ";
	for(ll i=0; i<n; i++)
	cout << a[i] << ' ';
	
	return 0;
}