#include <bits/stdc++.h>
using namespace std;
#define N 1005
int fin[N], n;

void solve(int l, int r, vector<int> &v) {
	if (v.size() == 1) {
		fin[l] = v[0];
		return;
	}
	shuffle(v.begin(), v.end(), mt19937());
	int md = (l + r) / 2;
	vector<int> lv, rv;
	set<int> st;
	for (int i = 0; i < v.size(); i++) {
		if (lv.size() == md - l + 1) {
			rv.push_back(v[i]);
			continue;
		}	else if (rv.size() == r - md) {
			lv.push_back(v[i]);
			continue;
		}	else if (!st.size()) {
			st.insert(v[i]);
			continue;
		}
		int tp = *st.begin();
		st.erase(tp);
		cout << "0 ";
		for (int j = 1; j <= md; j++)
			cout << tp << ' ';
		for (int j = md + 1; j <= n; j++)
			cout << v[i] << ' ';
		cout << endl;
		int qry;
		cin >> qry;
		if (qry == 2)
			lv.push_back(tp), rv.push_back(v[i]);
		else if (!qry)
			rv.push_back(tp), lv.push_back(v[i]);
		else
			st.insert(tp), st.insert(v[i]);
	}
	for (int it : st) {
		if (lv.size() == md - l + 1)
			rv.push_back(it);
		else
			lv.push_back(it);
	}
	solve(l, md, lv), solve(md + 1, r, rv);
}

int main() {
	cin >> n;
	vector<int> v;
	for (int i = 1; i <= n; i++)
		v.push_back(i);
	solve(1, n, v);
	cout << "1 ";
	for (int i = 1; i <= n; i++)
		cout << fin[i] << ' ';
	cout << endl;
}