#include <bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)

using namespace std;

mt19937 rnd(43);

vector<int> p, rk;

int getp(int a){
	return a == p[a] ? a : p[a] = getp(p[a]);
}

void unite(int a, int b){
	a = getp(a), b = getp(b);
	if (a == b) return;
	if (rk[a] < rk[b]) swap(a, b);
	rk[a] += rk[b];
	p[b] = a;
}

int n;

int ask(int b, int v, int u){
	cout << "0 ";
	forn(i, n){
		if (i) cout << " ";
		if ((i >> b) & 1)
			cout << u + 1;
		else
			cout << v + 1;
	}
	cout << endl;
	int x;
	cin >> x;
	return x;
}

int main(){
	cin >> n;
	vector<int> ans(n);
	forn(b, 10){
		int cnt1 = 0;
		forn(i, n) cnt1 += (i >> b) & 1;
		int cnt0 = n - cnt1;
		
		queue<int> q;
		{
			vector<int> p(n);
			iota(p.begin(), p.end(), 0);
			shuffle(p.begin(), p.end(), rnd);
			forn(i, n) q.push(p[i]);
		}
		rk.assign(n + 2, 1);
		p.resize(n + 2);
		iota(p.begin(), p.end(), 0);
		while (q.size() > 1){
			int v = q.front();
			q.pop();
			int u = q.front();
			q.pop();
			if (rnd() & 1) swap(v, u);
			int x = ask(b, v, u);
			if (x == 1){
				unite(v, u);
				if (rk[getp(v)] > cnt0)
					unite(v, n + 1);
				else if (rk[getp(v)] > cnt1)
					unite(v, n);
				else
					q.push(v);
			}
			else{
				if (x == 0) swap(v, u);
				cnt0 -= rk[getp(v)];
				unite(v, n);
				cnt1 -= rk[getp(u)];
				unite(u, n + 1);
			}
		}
		if (q.size() == 1){
			int v = q.front();
			q.pop();
			unite(v, rk[getp(v)] == cnt1 ? n + 1 : n);
		}
		forn(i, n){
			int val = getp(i) == getp(n + 1);
			ans[i] |= val << b;
		}
	}
	vector<int> p(n);
	forn(i, n) p[ans[i]] = i;
	cout << "1";
	forn(i, n) cout << " " << p[i] + 1;
	cout << endl;
}