#include<bits/stdc++.h>
#define rep(i,l,r) for (int i(l), i##end(r); i <= i##end; ++i)
#define per(i,r,l) for (int i(r), i##end(l); i >= i##end; --i)
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define eb emplace_back
#define File(filename) freopen(filename".in", "r", stdin), freopen(filename".out", "w", stdout)
#define clr(arr) memset(arr, 0, sizeof(arr))
using namespace std;
template <typename Tx> inline void read(Tx &x) {x = 0; bool f = 0; char ch = getchar(); while (ch < '0' || ch > '9') f ^= ch == '-', ch = getchar(); while (ch <= '9' && ch >= '0') x = x * 10 + ch - '0', ch = getchar(); if (f) x = -x;}
template <typename Tx, typename ...Ty> inline void read(Tx &x, Ty &...y) {read(x); read(y...);}
template <typename Tx> inline void O_write(Tx x) {if (x > 9) O_write(x / 10); putchar('0' + x % 10);}
template <typename Tx> inline void write(Tx x, char ch = '\n') {O_write(x < 0 ? (putchar('-'), -x) : x); putchar(ch);}
template <typename T> inline void cmax(T &x, T y) {if (x < y) x = y;}
template <typename T> inline void cmin(T &x, T y) {if (x > y) x = y;}
namespace Main {

const int N = 1e3 + 9;

int b[N];

int n;
int p[N], a[N];

mt19937 mtrnd(chrono::system_clock::now().time_since_epoch().count());
vector <int> S[N];

#define sz(v) ((int)v.size())

int qcnt;
int query() {
    assert(++qcnt <= 6666);
    printf("0");
    rep (i, 1, n) printf(" %d", a[i]);
    printf("\n");
    fflush(stdout);
    int x = 0;
    read(x);
    // rep (i, 1, n) x += b[i] == a[i];
    return x;
}

void Merge(vector <int> &a, vector <int> o) {
    for (int i : o) a.eb(i);
}

void solve(int l, int r, vector <int> pos) {
    assert(sz(pos) == r - l + 1);
    for (int v : pos) {
        S[v].resize(1);
        S[v][0] = v;
    }
    if (l == r) {
        p[l] = pos[0];
        return ;
    }
    shuffle(pos.begin(), pos.begin(), mtrnd);
    int mid = (l + r) >> 1;
    vector <int> vl, vr;
    vl.clear(); vr.clear();
    while (!pos.empty()) {
        if (pos.size() == 1) {
            if (sz(vl) != mid - l + 1) for (int v : S[pos[0]]) vl.eb(v);
            if (sz(vr) != r - mid) for (int v : S[pos[0]]) vr.eb(v);
            break;
        }
        int p1 = pos.back(); pos.pop_back();
        int p2 = pos.back(); pos.pop_back();

        // printf("p1 = %d, p2 = %d\n", p1, p2);
        
        rep (i, 1, n) a[i] = p1;
        rep (i, l, mid) a[i] = p1;
        rep (i, mid + 1, r) a[i] = p2;
        int x = query();
        if (x == 0) {
            Merge(vl, S[p2]);
            Merge(vr, S[p1]);
            continue;
        }
        if (x == 2) {
            Merge(vl, S[p1]);
            Merge(vr, S[p2]);
            continue;
        }
        if (sz(S[p1]) <= sz(S[p2])) {
            for (int v : S[p1]) S[p2].eb(v);
            pos.eb(p2);
        } else {
            for (int v : S[p2]) S[p1].eb(v);
            pos.eb(p1);
        }
    }

    solve(l, mid, vl);
    solve(mid + 1, r, vr);
}

void skymaths() {
    read(n);

    // rep (i, 1, n) b[i] = i;
    // shuffle(b + 1, b + n + 1, mtrnd);
    // printf("b:");
    // rep (i, 1, n) {
    //     write(b[i], " \n"[i == n]);
    // }

    vector <int> pos(n);
    rep (i, 1, n) pos[i - 1] = i;
    solve(1, n, pos);

    cerr << qcnt << endl;

    printf("1");
    rep (i, 1, n) printf(" %d", p[i]);
    printf("\n");
    fflush(stdout);
}

signed main() {
    // freopen("a.in", "r", stdin);
    int T = 1;
    // read(T);
    for (int Tid = 1; Tid <= T; ++Tid) {
        skymaths();
    }
    return 0;
} } signed main() { Main::main(); return 0;}