#include <bits/stdc++.h>
#define int long long
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define pb emplace_back
#define For(i, x, y) for (int i = (x); i <= (y); i ++)
#define rep(i, x, y) for (int i = (x); i >= (y); i --)
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
#define sz(v) (int)((v).size())
#define ull unsigned long long
#define ls (p << 1)
#define rs (p << 1 | 1)
#define mp make_pair
#define i128 __int128
#define db long double
#define vi vector< int >
#define mem(v, x) memset(v, x, sizeof(v))
#define A3 array< int, 3 >
#define A4 array< int, 4 >
#define vpii vector< pair< int, int > >
using namespace std;
mt19937_64 rnd(time(0));
template< typename T > void cmin(T &x, T y) { return x = min(x, y), void(); }
template< typename T > void cmax(T &x, T y) { return x = max(x, y), void(); }
int ksm(int x, int y, int p) {
    int v = 1; x %= p;
    while (y) v = 1ll * v * ((y & 1) ? x : 1) % p, x = 1ll * x * x % p, y >>= 1;
    return (v % p + p) % p;
}
bool MemoryST;
const int N = 1005;
const int mod = 998244353;
const long long INF = 1e18;
const int base = 13131;
int n;
int ans[N], q[N];
int cnt = 0;
int query() {
	if (cnt == 6665) {
		while (1);
	}
	cnt ++;
	cout << "0 ";
	For (i, 1, n) cout << q[i] << ' ';
	cout << endl;
	int res; cin >> res;
	return res;
}
int bel[N], fa[N];
int find(int x) {
	return fa[x] == x ? x : fa[x] = find(fa[x]);
}
struct node {
	int x;
	ull val;
} ;
bool operator < (node i, node j) {
	return i.val < j.val;
}
void solve(int l, int r, vi a) {
	if (l == r) return ans[l] = a[0], void();
	int mid = (l + r) >> 1;
	set< node > s;
	for (int x : a) s.insert(node{x, rnd()}), fa[x] = x;
	while (sz(s) > 1) {
		auto [x, _] = *s.begin(); s.erase(node{x, _});
		auto [y, __] = *s.begin(); s.erase(node{y, __});
		For (i, 1, mid) q[i] = x;
		For (i, mid + 1, n) q[i] = y;
		int res = query();
		if (res == 0) bel[x] = 1, bel[y] = 0;
		else if (res == 2) bel[x] = 0, bel[y] = 1;
		else {
			if (find(x) != x || find(y) != y) while (1);
			fa[x] = y;
			s.insert(node{y, rnd()});
		}
	}
	vi b, c;
	if (sz(s) == 1) {
		auto [y, _] = *s.begin();
		vi val;
		for (int x : a) {
			if (find(x) == y) {
				val.pb(x); continue;
			}
			if (!bel[find(x)]) b.pb(x); else c.pb(x);
		}
		if (sz(b) != mid - l + 1) for (int x : val) b.pb(x);
		else for (int x : val) c.pb(x);
	} else {
		for (int x : a) if (!bel[find(x)]) b.pb(x); else c.pb(x);
	}
	solve(l, mid, b); solve(mid + 1, r, c);
	return;
}
void Main() {
	cin >> n; vi a;
	For (i, 1, n) a.pb(i);
	solve(1, n, a);
	cout << "1 ";
	For (i, 1, n) cout << ans[i] << ' ';
	cout << endl;
    return;
}
bool MemoryED;
signed main() {
    ios :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    // cerr << fixed << setprecision(6) << (&MemoryST - &MemoryED) / 1048576.0 << "MB\n";
    int TESTCNT = 1;
    // cin >> TESTCNT;
    while (TESTCNT --) Main();
    // cerr << endl << 1e3 * clock() / CLOCKS_PER_SEC << "ms"; 
    return 0;
}