#include<bits/stdc++.h>

using namespace std;
const int N = 1e3 + 7;
int n;
vector<int> G[N];
int res[N], bel[N], a[N];
int cnt=0;
int ask(int l, int r, int x, int y) {
    int mid = (l + r) >> 1;
    int ans = 0;
    cnt++;
    if(cnt==6667)assert(0);
    cout << "0 ";
//    for (int i = 1; i <= mid; i++)ans += (a[i] == x);
//    for (int i = mid + 1; i <= n; i++)ans += (a[i] == y);
    for (int i = 1; i <= mid; i++)cout << x << " ";
    for (int i = mid + 1; i <= n; i++)cout << y << " ";
    cout << endl;
    cin >> ans;
//    cout << l << " " << r << " " << x << " " << y << " " << ans << "\n";
    return ans;
}

void dfs(int u) {
    for (auto v: G[u]) {
        if (bel[v] != -1)continue;
        bel[v] = bel[u];
        dfs(v);
    }
}

void solve(int l, int r, vector<int> x) {
    if (l == r) {
        res[l] = x.back();
        return;
    }
    random_shuffle(x.begin(), x.end());
    vector<int> y = x;
    int mid = (l + r) >> 1;
    int len1 = mid - l + 1, len2 = r - mid;
    for (auto v: x) {
        G[v].clear();
        bel[v] = -1;
    }
    while (y.size()) {
        int siz = y.size();
        vector<int> nxt;
        for (int i = 0; i < siz - 1; i += 2) {
            int ans = ask(l, r, y[i], y[i + 1]);
            if (ans == 0) {
                bel[y[i + 1]] = 0;
                bel[y[i]] = 1;
//                cout << y[i] << " " << y[i + 1] << "\n";
                len1--;
                len2--;
            } else if (ans == 2) {
                bel[y[i + 1]] = 1;
                bel[y[i]] = 0;
                len2--;
                len1--;
            } else {
                G[y[i]].push_back(y[i + 1]);
                nxt.push_back(y[i]);
            }
        }
        if (siz & 1) {
            if (len1 & 1)bel[y.back()] = 0;
            else bel[y.back()] = 1;
        }
        len1 /= 2;
        len2 /= 2;
        swap(nxt, y);
    }
    for (auto v: x) {
        if (bel[v] != -1)dfs(v);
    }
    vector<int> L, R;
    for (auto v: x) {
        if (bel[v] == 0)L.push_back(v);
        else R.push_back(v);
    }
//    for (int i = 1; i <= n; i++)cout << bel[i] << " ";
//    cout << "\n";
    solve(l, mid, L);
    solve(mid + 1, r, R);
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    vector<int> x;
//    for (int i = 1; i <= n; i++)cin >> a[i];
    for (int i = 1; i <= n; i++)x.push_back(i);
    solve(1, n, x);
    cout << "1 ";
    for (int i = 1; i <= n; i++)cout << res[i] << " ";
    cout << endl;
    return 0;
}