#include <bits/stdc++.h>
#define long long long int
#define DEBUG
using namespace std;

// @author: pashka

int n;

void init() {
}

int cnt = 0;
int ask(vector<int> q) {
    cout << "0";
    for (int i = 0; i < n; i++) {
        cout << " " << (q[i] + 1);
    }
    cout << endl;
    cnt++;
    assert(cnt <= 6666);
    int s;
    cin >> s;
    return s;
}

void answer(vector<int> q) {
    cout << "1";
    for (int i = 0; i < n; i++) {
        cout << " " << (q[i] + 1);
    }
    cout << endl;
}

//void init() {
//    p.resize(n);
//    for (int i = 0; i < n; i++) {
//        p[i] = i;
//        int j = rand() % (i + 1);
//        swap(p[i], p[j]);
//    }
//}
//
//int cnt = 0;
//int ask(vector<int> q) {
//    int s = 0;
//    for (int i = 0; i < n; i++) {
//        if (p[i] == q[i]) s++;
//    }
//    cnt++;
//    return s;
//}
//
//void answer(vector<int> q) {
//    for (int i = 0; i < n; i++) assert(p[i] == q[i]);
//    cout << cnt << "\n";
//}

vector<int> ans;

int ask(int l, int m, int r, int c1, int c2) {
    vector<int> q(n);
    for (int i = 0; i < n; i++) {
        if (i < l || i >= r) q[i] = c1;
        else if (i < m) q[i] = c1;
        else q[i] = c2;
    }
    return ask(q);
}

void add_all(vector<int> &a, vector<int> &b) {
    a.insert(a.end(), b.begin(), b.end());
}

void go(int l, int r, vector<int> a) {
    if (r - l == 1) {
        ans[l] = a[0];
        return;
    }
    int m = (l + r) / 2;
    if (r - l == 2) {
        ans[l] = a[0];
        ans[l + 1] = a[1];
        if (ask(l, m, r, a[0], a[1]) == 0) {
            swap(ans[l], ans[l + 1]);
        }
        return;
    }
    if (r - l == 3) {
        int t = ask(l, m, r, a[0], a[1]);
        int f = (t + 1) % 3;
        ans[l] = a[f];
        go(m, r, {a[(f + 1) % 3], a[(f + 2) % 3]});
        return;
    }
    vector<vector<int>> aa;
    for (int x : a) {
        aa.push_back({x});
    }
    vector<int> al;
    vector<int> ar;
    while (!aa.empty()) {
        if ((int)al.size() == m - l) {
            for (auto &t : aa) {
                add_all(ar, t);
            }
            break;
        }
        if ((int)ar.size() == r - m) {
            for (auto &t : aa) {
                add_all(al, t);
            }
            break;
        }
        vector<vector<int>> aaa;
        while (aa.size() >= 2) {
            auto x = aa.back();
            aa.pop_back();
            auto y = aa.back();
            aa.pop_back();
            int t = ask(l, m, r, x[0], y[0]);
            if (t == 0) {
                add_all(al, y);
                add_all(ar, x);
            } else if (t == 2) {
                add_all(al, x);
                add_all(ar, y);
            } else {
                add_all(x, y);
                aaa.push_back(x);
            }
        }
        if (!aa.empty()) {
            aaa.push_back(aa.back());
        }
        aa = aaa;
    }
    go(l, m, al);
    go(m, r, ar);
}

int main() {
    ios::sync_with_stdio(false);

    cin >> n;

    init();
    vector<int> a(n);
    for (int i = 0; i < n; i++) a[i] = i;
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    shuffle(a.begin(), a.end(), rng);
    ans.resize(n);
    go(0, n, a);

    answer(ans);

    return 0;
}