#include <bits/stdc++.h>
#define ll int
#define fi first
#define se second
#define mkp make_pair
#define pir pair <ll, ll>
#define pb emplace_back
#define i128 __int128
using namespace std;
const ll maxn = 2e6 + 10, inf = 1e9;
ll n, a[maxn], b[maxn], d[maxn];
ll query() {
	printf("0");
	for(ll i = 1; i <= n; i++) printf(" %d", b[i]);
	puts(""), fflush(stdout);
	ll x; scanf("%d", &x); return x;
}
ll find(ll x) { return d[x] ^ x? d[x] = find(d[x]) : x; }
void solve(ll l, ll r, vector <ll> t) {
	if(l == r) { a[l] = t[0]; return; }
	ll mid = l + r >> 1;
	for(ll x: t) d[x] = x;
	vector <ll> L, R, ver = t;
	while(t.size() > 1) {
		ll x = t[t.size() - 1], y = t[t.size() - 2];
		t.pop_back(), t.pop_back();
		for(ll i = 1; i <= n; i++)
			b[i] = i <= mid? x : y;
		ll tmp = query();
		if(tmp == 1) {
			d[x] = y, t.pb(y);
		} else if(tmp == 0) {
			for(ll u: ver)
				if(find(u) == x) R.pb(u);
				else if(find(u) == y) L.pb(u);
		} else {
			for(ll u: ver)
				if(find(u) == x) L.pb(u);
				else if(find(u) == y) R.pb(u);
		}
	}
	if(!t.empty()) {
		for(ll u: ver)
			if(find(u) == t[0]) {
				if(L.size() < mid - l + 1) L.pb(u);
				else R.pb(u);
			}
	}
	solve(l, mid, L), solve(mid + 1, r, R);
}
int main() {
	scanf("%d", &n); srand(time(0));
	vector <ll> t(n);
	for(ll i = 0; i < n; i++) t[i] = i + 1;
	random_shuffle(t.begin(), t.end());
	solve(1, n, t);
	printf("1 ");
	for(ll i = 1; i <= n; i++) printf("%d ", a[i]);
	return 0;
}