#include <bits/stdc++.h>
using namespace std;

mt19937 rnd(time(0) ^ (unsigned long long)(new char));

const int N = 1005;

int n, a[N], b[N], ans[N];

int query(int l, int r, int x, int y) {
	int mid = l + r >> 1, res = 0;
	cout << 0 << ' ';
	for (int i = 1; i <= n; i++) {
		cout << (i > mid && i <= r ? y : x) << ' ';
	}
	cout << endl;
	cin >> res;
	return res;
}

void solve(int l, int r) {
	if (l == r) {
		return;
	}
	int mid = l + r >> 1;
	for (int i = l, j = l, k = mid + 1; i <= r; i++) {
		if (j > mid) {
			b[k++] = a[i];
			continue;
		} else if (k > r) {
			b[j++] = a[i];
			continue;
		}
		for (int t = i + 1; t <= r; t++) {
			int res = query(l, r, a[i], a[t]);
			if (res == 2) {
				for (int p = i; p < t; p++) {
					b[j++] = a[p];
				}
				b[k++] = a[t];
				i = t;
				break;
			} else if (res == 0) {
				for (int p = i; p < t; p++) {
					b[k++] = a[p];
				}
				b[j++] = a[t];
				i = t;
				break;
			}
		}
	}
	for (int i = l; i <= r; i++) {
		a[i] = b[i];
	}
	solve(l, mid);
	solve(mid + 1, r);
}

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		a[i] = i;
	}
	shuffle(a + 1, a + n + 1, rnd);
	solve(1, n);
	cout << 1 << ' ';
	for (int i = 1; i <= n; i++) {
		cout << a[i] << ' ';
	}
	cout << endl;

	return 0;
}