#include<bits/stdc++.h>
#define M 1005
using namespace std;
int n, ans[M], a[M];
int ask(int l, int r, int x, int y)
{
	int mid = (l + r) >> 1;
	printf("0 ");
	for(int i = 1; i <= mid; i++) printf("%d ", x);
	for(int i = mid + 1; i <= n; i++) printf("%d ", y);
	puts("");
	fflush(stdout);
	int res;
	scanf("%d", &res);
	return res;
}
void solve(int l, int r, vector<int> v)
{
	if(l == r)
	{
		ans[l] = v[0];
		return;
	}
	random_shuffle(v.begin(), v.end());
	vector<int> L[2];
	int fl = 0, lst = 0;
	L[0].push_back(v[0]);
	for(int i = 1; i < v.size(); i++)
	{
		int w = ask(l, r, v[i - 1], v[i]);
		if(w != 1)
		{
			L[lst ^ 1].push_back(v[i]), lst ^= 1;
			if(!fl)
			{
				if(w == 0) fl = lst;
				else fl = lst ^ 1;
			}
		}
		else
		{
			L[lst].push_back(v[i]);
		}
	}
	int mid = (l + r) >> 1;
	solve(l, mid, L[fl]);
	solve(mid + 1, r, L[fl ^ 1]);
}
int main()
{
	scanf("%d", &n);
	vector<int> v;
	for(int i = 1; i <= n; i++) v.push_back(i);
	if(n<500)solve(1, n, v);
	printf("1 ");
	for(int i = 1; i <= n; i++) printf("%d ", ans[i]);
	puts("");
	fflush(stdout);
	return 0;
}