#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937 rnd(time(0));
int n, res, ans[10005], f[10005], qy[10005], re[10005];
int find(int x) {
	if (x == f[x]) {
		return x;
	}
	return f[x] = find(f[x]);
}
void print() {
	cout << "1 ";
	for (int i = 1; i <= n; i++) {
		cout << ans[i] << " "; 
	}
	return ;
}
void ask() {
	cout << "0 ";
	for (int i = 1; i <= n; i++) {
		cout << qy[i] << " ";
	}
	cout << "\n";
	cout.flush();
}
void solve(int l, int r, vector<int> cur) {
	if (l == r) {
		ans[l] = cur[0];
		return ;
	}
	int mid = l + r >> 1;
	for (int i = 0; i < cur.size(); i++) {
		f[cur[i]] = cur[i];
	}
	vector<int> l1, r1, del;
	while (cur.size() > 1) {
		random_shuffle(cur.begin(), cur.end());
		int u = cur[cur.size() - 1];
		int v = cur[cur.size() - 2];
		cur.pop_back();
		cur.pop_back();
		for (int j = 1; j <= mid; j++) {
			qy[j] = u;
		}
		for (int j = mid + 1; j <= n; j++) {
			qy[j] = v;
		}
		ask();
		cin >> res;
		if (!res) {
			l1.push_back(v);
			r1.push_back(u);
			re[v] = 0;
			re[u] = 1;
		}
		if (res == 1) {
			del.push_back(u);
			cur.push_back(v);
			f[u] = v;
		}
		if (res == 2) {
			l1.push_back(u);
			r1.push_back(v);
			re[u] = 0;
			re[v] = 1;
		}
	}
	if (cur.size() == 1) {
		int lft = cur[0];
		if (l1.size()) {
			for (int i = 1; i <= mid; i++) {
				qy[i] = lft;
			}
			for (int i = mid + 1; i <= n; i++) {
				qy[i] = l1[0];
			}
			ask();
			cin >> res;
			if (!res) {
				r1.push_back(lft);
				re[lft] = 1;
			} else {
				l1.push_back(lft);
				re[lft] = 0;
			}
		} else if (r1.size()) {
			for (int i = 1; i <= mid; i++) {
				qy[i] = r1[0];
			}
			for (int i = mid + 1; i <= n; i++) {
				qy[i] = lft;
			}
			ask();
			cin >> res;
			if (!res) {
				l1.push_back(lft);
				re[lft] = 0;
			} else {
				r1.push_back(lft);
				re[lft] = 1;
			} 
		}
	}
	for (int i = 0; i < del.size(); i++) {
		int fa = find(del[i]);
		if (!re[fa]) {
			l1.push_back(del[i]);
		} else {
			r1.push_back(del[i]);
		}
	}
	solve(l, mid, l1);
	solve(mid + 1, r, r1);
}
signed main() {
	cin >> n;
	vector<int> cur;
	for (int i = 1; i <= n; i++) {
		cur.push_back(i);
	}
	solve(1, n, cur);
	print();
	return 0;
}