#include<iostream>
#include<cstring>
#include<vector>
#include<random>
#include<numeric>
#include<cassert>
#include<algorithm>
using namespace std;
using LL = long long;
mt19937_64 rnd(1243214124);
int n;
int a[1005], p[1005], target[1005];

int cnt;

int ask(){
    cnt += 1;
    cout << "0";
    for(int i = 1; i <= n; i++){
        cout << ' ' << a[i];
    }
    cout << endl;

// #ifdef LOCAL
//     int ans = 0;
//     for(int i = 1; i <= n; i++) ans += (a[i] == target[i]);
//     return ans;
// #endif

    int t;
    cin >> t;
    return t;
}

int type[1005];

namespace DSU{
    int p[1005];
    vector<int> s[1005];

    void init(const vector<int> &v){
        for(auto x : v){
            p[x] = x;
            s[x] = {x};
        }
    }

    int find(int x){
        return p[x] == x ? x : p[x] = find(p[x]);
    }

    void merge(int x, int y){
        x = find(x), y = find(y);
        if (x != y){
            if (s[x].size() > s[y].size()){
                swap(x, y);
            }
            p[x] = y;
            for(auto u : s[x]) s[y].push_back(u);
        }
    }

}

void solve(int l, int r, vector<int> v){
    if (l == r){
        p[r] = v[0];
        return;
    }
    shuffle(v.begin(), v.end(), rnd);
    int mid = (l + r) / 2;
    vector<int> vl, vr;
    DSU::init(v);
    while(!v.empty()){
        if (v.size() == 1){
            if (vl.size() < mid - l + 1){
                for(auto u : DSU::s[DSU::find(v.back())]){
                    vl.push_back(u);
                }
            }
            else{
                for(auto u : DSU::s[DSU::find(v.back())]){
                    vr.push_back(u);
                }
            }
            break;
        }
        int t1 = v.back();
        v.pop_back();
        int t2 = v.back();
        v.pop_back();
        for(int i = 1; i <= mid; i++){
            a[i] = t1;
        }
        for(int i = mid + 1; i <= n; i++){
            a[i] = t2;
        }
        int cnt = ask();
        if (cnt == 1){
            DSU::merge(t1, t2);
            v.push_back(DSU::find(t1));
        }
        else if (cnt == 2){
            for(auto u : DSU::s[DSU::find(t1)]){
                vl.push_back(u);
            }
            for(auto u : DSU::s[DSU::find(t2)]){
                vr.push_back(u);
            }
        }
        else{
            for(auto u : DSU::s[DSU::find(t1)]){
                vr.push_back(u);
            }
            for(auto u : DSU::s[DSU::find(t2)]){
                vl.push_back(u);
            }
        }
    }
    solve(l, mid, vl);
    solve(mid + 1, r, vr);
}

int main(){

// #ifdef LOCAL
//     freopen("data.in", "r", stdin);
//     freopen("data.out", "w", stdout);
// #endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    cin >> n;
    // vector<int> v{4, 3, 2, 1, 5};
    // vector<int> v(n);
    // iota(v.begin(), v.end(), 1);
    // shuffle(v.begin(), v.end(), rnd);
    // for(int i = 1; i <= n; i++) target[i] = v[i - 1];

    vector<int> q(n);
    iota(q.begin(), q.end(), 1);
    solve(1, n, q);
    cout << "1";
    for(int i = 1; i <= n; i++) cout << ' ' << p[i];
    // for(int i = 1; i <= n; i++) assert(p[i] == target[i]);
    cout << endl;
    // assert(cnt <= 6666);
    // cout << cnt << '\n';

}