#pragma GCC optimize("Ofast")

#include "bits/stdc++.h"

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
#define rep1n(i, n) for (int i = 1; i <= (n); ++i)
#define repr(i, n) for (int i = (n) - 1; i >= 0; --i)
#define pb push_back
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define each(x, a) for (auto &x : a)
#define ar array
#define vec vector
#define range(i, n) rep(i, n)

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;

using vi = vector<int>;
using vl = vector<ll>;
using vpi = vector<pair<int, int>>;
using vvi = vector<vi>;

int Bit(int mask, int b) { return (mask >> b) & 1; }

template<class T>
bool ckmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool ckmax(T &a, const T &b) {
    if (b > a) {
        a = b;
        return true;
    }
    return false;
}

// [l, r)
template<typename T, typename F>
T FindFirstTrue(T l, T r, const F &predicat) {
    --l;
    while (r - l > 1) {
        T mid = l + (r - l) / 2;
        if (predicat(mid)) {
            r = mid;
        } else {
            l = mid;
        }
    }
    return r;
}


template<typename T, typename F>
T FindLastFalse(T l, T r, const F &predicat) {
    return FindFirstTrue(l, r, predicat) - 1;
}


const ll INF = 2e18;
const int INFi = 1e9;
const int N = 30 + 5;
const int LG = 20;

int ask(const vi &a) {
    cout << "0";
    rep(i, a.size()) cout << " " << a[i];
    cout << endl;
    int x; cin >> x;
    return x;
}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve() {
    int n; cin >> n;
    vi ans(n);
    function<void(int, int, vi&)> rec = [&] (int l, int r, vi &v) {
        if (l >= r) return;
        assert(r - l == (int)v.size());
        if (l + 1 == r)  {
            ans[l] = v[0];
            return;
        }
        int m = (l + r) / 2;
        vi L, R;
        shuffle(all(v), rng);
        vi cur;
        for(auto &x : v) {
            if ((int)L.size() + (int)cur.size() > m - l) {
                for(auto &t : cur) R.push_back(t);
                cur.clear();
            } else if ((int)R.size() + (int)cur.size() > r - m) {
                for(auto &t : cur) L.push_back(t);
                cur.clear();
            }
            if (cur.empty()) {
                cur.push_back(x);
                continue;
            }
            vi perm(n, x);
            for(int i = l; i < m; ++i) perm[i] = cur[0];
            int cnt = ask(perm);
            if (cnt == 0) {
                for(auto &y : cur) R.push_back(y);
                L.push_back(x);
                cur.clear();
                continue;
            }
            if (cnt == 2) {
                for(auto &y : cur) L.push_back(y);
                R.push_back(x);
                cur.clear();
                continue;
            }
            cur.push_back(x);
        }
        assert(!L.empty() || !R.empty());
        if (!cur.empty()) {
            if (L.size() != m - l) {
                for(auto &t : cur) L.push_back(t);
            } else {
                for(auto &t : cur) R.push_back(t);
            }
            cur.clear();
        }
        assert((int)L.size() == m - l);
        assert((int)R.size() == r - m);
        rec(l, m, L);
        rec(m, r, R);
    };
    vi v(n);
    iota(all(v), 1);
    rec(0, n, v);
    cout << "1";
    rep(i, n) cout << " " << ans[i];
    cout << endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(12) << fixed;
    int t = 1;
//    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}