#include<bits/stdc++.h>
#define M 1005
using namespace std;
int n, ans[M], a[M], rans[M], num;
mt19937 rnd(time(0));
void init()
{
	for(int i = 1; i <= n; i++) rans[i] = i;
	shuffle(rans + 1, rans + n + 1, rnd); 
}
int ask1(int l, int r, int x, int y)
{
	num++;
	int mid = (l + r) >> 1, cnt = 0;
	for(int i = 1; i <= mid; i++) if(rans[i] == x) cnt++;
	for(int i = mid + 1; i <= n; i++) if(rans[i] == y) cnt++;
	return cnt;
}
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;
	}
	shuffle(v.begin(), v.end(), rnd);
	vector<int> L[2];
	int prel = 0, x = 0;
	while(x < v.size() - 1)
	{
		int w = ask(l, r, v[x], v[x + 1]);
		if(w == 1) x++;
		else
		{
			w = (2 - w) / 2;
			for(int i = prel; i <= x; i++) L[w].push_back(v[i]);
			L[w ^ 1].push_back(v[x + 1]);
			prel = x = x + 2;
		}
	}
	int mid = (l + r) >> 1;
	if(prel != v.size())
	{
		int ps = (L[0].size() == mid - l + 1);
		for(int i = prel; i < v.size(); i++) L[ps].push_back(v[i]);
	}
	solve(l, mid, L[0]);
	solve(mid + 1, r, L[1]);
}
int main()
{
	scanf("%d", &n);
//	init();
	vector<int> v;
	for(int i = 1; i <= n; i++) v.push_back(i);
	solve(1, n, v);
//	int fl = 1;
//	for(int i = 1; i <= n; i++) fl &= (ans[i] == rans[i]);
//	if(fl) puts("AC");
//	else puts("WA");
//	cout << num << endl;
//	for(int i = 1; i <= n; i++) cout << rans[i] << " ";
//	puts("");
//	for(int i = 1; i <= n; i++) cout << ans[i] << " ";
//	puts("");
	printf("1 ");
	for(int i = 1; i <= n; i++) printf("%d ", ans[i]);
	puts("");
	fflush(stdout);
	return 0;
}