#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cerr << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

int n;
int fa[N], ans[N], id[N];
int find(int x) {
    return fa[x] == x ? x : fa[x] = find(fa[x]);
}
mt19937 rng(0);

void work(int l, int r, vector<int> a) {
    assert(a.size() == r - l + 1);
    if (l == r) {
        ans[l] = a[0];
        return;
    }
    for (int i: a) fa[i] = i;
    shuffle(a.begin(), a.end(), rng);
    vector<int> b = a;
    int mid = l + r >> 1;
    vector<int> al, ar;
    while (a.size() >= 2) {
        int x = a.back(); a.pop_back();
        int y = a.back(); a.pop_back();
        cout << 0;
        for (int i = 1; i <= mid; ++i) cout << ' ' << x;
        for (int i = mid + 1; i <= n; ++i) cout << ' ' << y;
        cout << endl;
        int res; cin >> res;
        if (res == 0) al.emplace_back(y), ar.emplace_back(x), id[y] = 0, id[x] = 1;
        else if (res == 2) al.emplace_back(x), ar.emplace_back(y), id[x] = 0, id[y] = 1;
        else {
            fa[y] = x;
            a.emplace_back(x);
        }
    }
    for (int i: b) {
        if (find(i) != i) {
            if (a.size() && find(i) == a[0]) continue;
            if (id[find(i)] == 0) al.emplace_back(i);
            else ar.emplace_back(i);
        }
    }
    if (a.size()) {
        if (al.size() < mid - l + 1) {
            for (int i: b) 
                if (find(i) == a[0]) al.emplace_back(i);
        } else {
            for (int i: b) 
                if (find(i) == a[0]) ar.emplace_back(i);
        }
    }
    work(l, mid, al), work(mid + 1, r, ar);
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    vector<int> a(n);
    iota(a.begin(), a.end(), 1);
    work(1, n, a);
    cout << 1;
    for (int i = 1; i <= n; ++i) {
        cout << ' ' << ans[i];
    }
    cout << endl;
}