#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 10;
const int inf1 = 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const int maxn = 1010;
int n, ds[maxn], dsz[maxn];

int find(int v) {
    if(v == ds[v]) return ds[v];
    return ds[v] = find(ds[v]);
}

void join(int u, int v) {
    u = find(u);
    v = find(v);
    if(u == v) return;
    if(dsz[u] < dsz[v]) swap(u,v);
    dsz[u]+= dsz[v];
    ds[v] = u;
}

int ask(vector<int> a) {
    cout << 0 << " ";
    for(auto x : a) cout << x << " ";
    cout << endl;
    cout.flush();
    int x;
    cin >> x;
    return x;
}
vector<int> sol(vector<int> a, int l, int r) {
    if(a.size() == 1) return a;
    vector<int> a0 = a;

    for(auto i : a) {
        ds[i] = i;
        dsz[i] = 1;
    }

    int mid = (l+r)/2;
    vector<int> qrr(n,a[0]);

    vector<int> islr(n+2,-1);
    int ql = 0;
    int qr = 0;
    while(ql != (mid-l+1) and qr != (r-(mid+1)+1)) {
        shuffle(all(a),rng);
        int x = a.back(); a.pop_back();
        int y = a.back(); a.pop_back();

        for(int i = l; i <= mid; i++) qrr[i] = x;
        for(int i = mid+1; i <= r; i++) qrr[i] = y;

        int ansq = ask(qrr);

        if(ansq == 2) {
            islr[x] = 0;
            ql+= dsz[x];

            islr[y] = 1;
            qr+= dsz[y];
        }
        else if(ansq == 0) {
            islr[x] = 1;
            qr+= dsz[x];

            islr[y] = 0;
            ql+= dsz[y];
        }
        else {
            join(x,y);
            a.pb(find(x));
        }
    }

    while(ql != (mid-l+1)) {
        int x = a.back(); a.pop_back();
        islr[x] = 0;
        ql+= dsz[x];
    }

    while(qr != (r-(mid+1)+1)) {
        int x = a.back(); a.pop_back();
        islr[x] = 1;
        qr+= dsz[x];
    }


    vector<int> al,ar;
    for(auto i : a0) {
        if(islr[find(i)] == 0) al.pb(i);
        else ar.pb(i);
    }

    al = sol(al,l,mid);
    ar = sol(ar,mid+1,r);
    a.clear();
    for(auto x : al) a.pb(x);
    for(auto x : ar) a.pb(x);
    return a;
}

void solve() {
    cin >> n;
    vector<int> a;
    for(int i = 1; i <= n; i++) {
        a.pb(i);
    }
    a = sol(a,0,n-1);

    cout << 1 << " ";
    for(auto x : a) cout << x << " ";
    cout << endl;
    cout.flush();

}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // #ifndef ONLINE_JUDGE
    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    // #endif

    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}