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

bool DEBUG = false;

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vector<int> pos(n), que(n), ans(n);
    int tot_que = 0;
    iota(ans.begin(), ans.end(), 0); // shuffle(ans.begin(), ans.end(), rng);
    auto ask = [&]() {
        if (tot_que++ >= 6666) {
            if (DEBUG) {
                // assert(false);
            } else {
                // troll
                for (int i = 0; ; i++) {
                    tot_que++;
                }
            }
        }
        if (!DEBUG) {
            cout << 0;
            for (int v : que) {
                cout << " " << v + 1;
            }
            cout << endl;
            int ret; cin >> ret; return ret;
        } else {
            int cnt = 0;
            for (int i = 0; i < n; i++) {
                cnt += ans[i] == que[i];
            }
            return cnt;
        }
    };
    auto check = [&](int u, int v, int bit) {
        for (int j = 0; j < n; j++) {
            que[j] = (j >> bit & 1) ? u : v;
        }
        return ask();
    };
    for (int lg = (n == 1 ? -1 : __lg(n - 1)); lg >= 0; lg--) {
        vector<int> cur(n, -1);
        vector<list<int>> vals(n);
        if (lg > 0) {
            for (int i = 0; i < n; i++) {
                vals[i].push_back(i);
            }
            shuffle(vals.begin(), vals.end(), rng);
        } else {
            vector<vector<int>> buc(n);
            for (int i = 0; i < n; i++) {
                buc[pos[i]].push_back(i);
            }
            for (int i = 0, cnt = 0; i < n; i++) {
                for (int v : buc[i]) {
                    vals[cnt++].push_back(v);
                }
            }
        }
        while (vals.size() >= 2) {
            vector<list<int>> nxt;
            for (int i = 0; i < vals.size(); i += 2) {
                if (i + 1 < vals.size()) {
                    int u = vals[i].front(), v = vals[i + 1].front();
                    int ret = check(u, v, lg);
                    if (ret % 2 == 0) {
                        // u is 0, v = 1
                        {
                            for (int x : vals[i]) {
                                cur[x] = ret / 2;
                            }
                        }
                        {
                            for (int x : vals[i + 1]) {
                                cur[x] = 1 - ret / 2;
                            }
                        }
                    } else {
                        vals[i].splice(vals[i].end(), vals[i + 1]);
                        nxt.push_back(vals[i]);
                    }
                } else {
                    nxt.push_back(vals[i]);
                }
            }
            vals = move(nxt);
        }
        if (vals.size() == 1) {
            int cnt_half_1 = 0, tot_half_1 = 0;
            for (int i = 0; i < n; i++) {
                if (cur[i] == 1) {
                    cnt_half_1++;
                }
                if (i >> lg & 1) {
                    tot_half_1++;
                }
            }
            for (int x : vals[0]) {
                cur[x] = (cnt_half_1 != tot_half_1);
            }
        }
        for (int i = 0; i < n; i++) {
            pos[i] |= (cur[i] << lg);
        }
        cerr << tot_que << '\n';
    }
    vector<int> per(n);
    for (int i = 0; i < n; i++) {
        per[pos[i]] = i;
    }
    if (!DEBUG) {
        cout << 1;
        for (int i = 0; i < n; i++) {
            cout << " " << per[i] + 1;
        }
        cout << endl;
    } else {
        for (int i = 0; i < n; i++) {
            if (ans[i] != per[i]) {
                cout << "WA!\n";
                return 0;
            }
        }
        cout << "tot query: " << tot_que << '\n';
    }
}
// 3 1 5 2 4