#include<bits/stdc++.h>
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define dbg(x) cout<<#x"="<<x<<' '

using namespace std;
typedef long long ll;

int n;
int P[1005];
int query_cnt;
int force(const vector<int>&a) {
    query_cnt++;
    int ans = 0;
    for (int i = 1; i <= n; i++) ans += P[i] == a[i];
    return ans;
}

int ask(const vector<int>&a) {
    // return force(a);
    cout << 0;
    for (int i = 1; i <= n; i++) cout << ' ' << a[i];
    cout << endl;
    int x;
    cin >> x;
    return x;
}
int p[1005];

void solve(int l, int r, vector<int> a) {
    if (l == r) {
        p[l] = a[0];
        return;
    }
    random_shuffle(a.begin(), a.end());

    vector<int> L, R;
    int mid = l + r >> 1;

    auto Ask = [&](int x, int y) -> int {
        vector<int> v(n + 1);
        for (int i = 1; i < l; i++) v[i] = a[0];
        for (int i = l; i <= mid; i++) v[i] = x;
        for (int i = mid + 1; i <= r; i++) v[i] = y;
        for (int i = r + 1; i <= n; i++) v[i] = a[0];
        int t = ask(v);
        return t;
    };
    
    vector<vector<int>> g(n + 1);
    for (int i = 1; i <= n; i++) g[i].push_back(i);

    while (a.size() > 1) {
        if (L.size() == (mid - l + 1)) break;
        if (R.size() == (r - mid)) break;
        vector<int> na;
        int len = a.size();
        for (int i = 1; i < len; i += 2) {
            int x = a[i - 1];
            int y = a[i];
            int ans = Ask(x, y);
            if (ans == 0) {
                for (int t : g[x]) R.push_back(t);
                for (int t : g[y]) L.push_back(t);
            }else if (ans == 2) {
                for (int t : g[x]) L.push_back(t);
                for (int t : g[y]) R.push_back(t);
            }else {
                for (int t : g[y]) g[x].push_back(t);
                na.push_back(x);
            }
        }
        if (a.size() % 2) na.push_back(a.back());
        a = na;
    }
    if (a.size()) {
        if (L.size() != (mid - l + 1)) {
            for (int x : a) for (int t : g[x]) L.push_back(t);
        }
        if (R.size() != (r - mid)) {
            for (int x : a) for (int t : g[x]) R.push_back(t);
        }
    }

    solve(l, mid, L);
    solve(mid + 1, r, R);
}

int main() {
    fastio;
    srand(time(0));
    cin >> n;
    // iota(P + 1, P + n + 1, 1);

    vector<int> a(n);
    iota(a.begin(), a.end(), 1);
    solve(1, n, a);

    // cout << query_cnt << '\n';;
    // int ans = 0;
    // for (int i = 1; i <= n; i++) ans += (p[i] != i);
    // cout << ans;
    cout << 1;
    for (int i = 1; i <= n; i++) cout << ' ' << p[i];

    return 0;
}