#include <bits/stdc++.h>
#include <immintrin.h>

using namespace std;

using ll = long long;
using ld = long double;
# define x first
# define y second
# define all(x) x.begin(), x.end()
# define rall(x) x.rbegin(), x.rend()

mt19937 mt(123);

void solve();
void init();

int32_t main() {
#ifndef LOCAL
    cin.tie(nullptr)->sync_with_stdio(false);
#endif
    init();
    cout << fixed << setprecision(10);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}

void init() {}

constexpr int N = 1010;
int dsu[N], ans[N], n, have = 0;

int get(int x) {
    return dsu[x] == x ? x : dsu[x] = get(dsu[x]);
}

void merge(int x, int y) {
    dsu[get(y)] = get(x);
}

int ask() {
    cout << "0 ";
    for (int i = 0; i < n; i++) {
        cout << ans[i] << ' ';
    }
    cout << endl;
    int res;
    cin >> res;
    return res - have;
}

void rec(int l, int r, vector<int> val) {
    vector<int> oval = val;
    if (l == r) {
        ans[l] = val[0];
        have++;
        return;
    }
    for (int i = 0; i < oval.size(); i++) {
        dsu[oval[i]] = oval[i];
    }
    int mid = (r + l) / 2;
    vector<int> vall, valr;
    while (vall.size() + valr.size() < r - l + 1) {
        vector<int> ost;
        shuffle(all(val), mt);
        while (!val.empty()) {
            if (val.size() == 1 && ost.empty()) {
                if (vall.empty()) {
                    int nt = valr[0];
                    for (int i = l; i <= mid; i++) {
                        ans[i] = nt;
                    }
                    for (int i = mid + 1; i <= r; i++) {
                        ans[i] = val.back();
                    }
                    if (ask()) {
                        valr.push_back(val.back());
                    } else {
                        vall.push_back(val.back());
                    }
                    val.pop_back();
                } else {
                    int nt = vall[0];
                    for (int i = mid + 1; i <= r; i++) {
                        ans[i] = nt;
                    }
                    for (int i = l; i <= mid; i++) {
                        ans[i] = val.back();
                    }
                    if (ask()) {
                        for (int i = 0; i < oval.size(); i++) {
                            if (get(oval[i]) == get(val.back())) {
                                vall.push_back(oval[i]);
                            }
                        }
                    } else {
                        for (int i = 0; i < oval.size(); i++) {
                            if (get(oval[i]) == get(val.back())) {
                                valr.push_back(oval[i]);
                            }
                        }
                    }
                    val.pop_back();
                }
            } else {
                if (val.size() == 1) {
                    val.push_back(ost.back());
                    ost.pop_back();
                }
                int ff = val.back();
                val.pop_back();
                int ss = val.back();
                val.pop_back();
                for (int i = l; i <= mid; i++) {
                    ans[i] = ff;
                }
                for (int i = mid + 1; i <= r; i++) {
                    ans[i] = ss;
                }
                int res = ask();
                if (res == 2) {
                    for (int i = 0; i < oval.size(); i++) {
                        if (get(oval[i]) == get(ff)) {
                            vall.push_back(oval[i]);
                        }
                    }
                    for (int i = 0; i < oval.size(); i++) {
                        if (get(oval[i]) == get(ss)) {
                            valr.push_back(oval[i]);
                        }
                    }
                } else if (res == 0) {
                    for (int i = 0; i < oval.size(); i++) {
                        if (get(oval[i]) == get(ss)) {
                            vall.push_back(oval[i]);
                        }
                    }
                    for (int i = 0; i < oval.size(); i++) {
                        if (get(oval[i]) == get(ff)) {
                            valr.push_back(oval[i]);
                        }
                    }
                } else {
                    merge(ff, ss);
                    ost.push_back(ff);
                }
            }
        }
        swap(val, ost);
    }
    for (int i = mid + 1; i <= r; i++) {
        ans[i] = vall[0];
    }
    rec(l, mid, vall);
    rec(mid + 1, r, valr);
}

void solve() {
    cin >> n;
    vector<int> v(n);
    for (int i = 0; i < n; i++) {
        v[i] = i + 1;
    }
    rec(0, n - 1, v);
    cout << "1 ";
    for (int i = 0; i < n; i++) {
        cout << ans[i] << ' ';
    }
    cout << endl;
}