#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;

const int N = 1010; using pii = pair<int, int>;
mt19937 rnd(std::chrono::steady_clock().now().time_since_epoch().count());
int n, vis[N], b[N], a[N], p[N];
int T;
struct DSU {
    int fa[N];
    void init() {for(int i = 1; i <= n; ++i)    fa[i] = i;}
    int find(int x) {return x != fa[x] ? fa[x] = find(fa[x]) : x;}
    void merge(int x, int y)    {x = find(x), y = find(y);  fa[x] = y;}
}dsu;
int ask(int x, int y, int els, int l, int mid, int r) {
    memset(p, 0, sizeof(p)), ++T;
    // if(T > 6666) {
    //     cout << "1 ";
    //     for(int i = 1; i <= n; ++i) cout << i << " ";
    //     cout << "\n";   exit(0);
    // }
    for(int i = l; i <= mid; ++i)   p[i] = x;
    for(int i = mid + 1; i <= r; ++i)   p[i] = y;
    for(int i = 1; i <= n; ++i) if(!p[i])   p[i] = els;
    cout << "0 ";
    for(int i = 1; i <= n; ++i) cout << p[i] << " ";
    cout << endl;   int res = 0;
    #ifdef Kelly 
        for(int i = 1; i <= n; ++i) res += p[i] == b[i];
        return res;
    #endif 
    cin >> res; return res;
}
void solve(int l, int r, vector<int> p) {
    if(l > r || p.empty())  return;
    if(l == r)  return void(a[l] = p[0]);
    int mid = (l + r) >> 1;
    vector<int> tmpl, tmpr, tmp = p; vector<pii> lsh;
    int nw = p[0];
    dsu.init();
    auto del = [&](int x) -> void   {swap(p[x], p.back()), p.pop_back();};
    // cerr << l << " " << r << " " << mid << "\n";
    // for(int x : p)  cerr << x << " ";
    // cerr << "\n";
    while(p.size() > 1) {
        int x = rnd() % p.size(), y = rnd() % p.size();
        while(y == x)   y = rnd() % p.size();
        if(x > y)   swap(x, y);
        int u = p[x], v = p[y];
        del(y), del(x);
        int sum = ask(u, v, nw, l, mid, r);
        if(sum == 0)    tmpl.pb(v), tmpr.pb(u);
        else if(sum == 2)   tmpl.pb(u), tmpr.pb(v);
        else    dsu.merge(u, v), p.pb(dsu.find(v));
    }
    if(p.size()) {
        int res = ask(tmpr[0], p[0], tmpr[0], l, mid, r);
        if(res) tmpr.pb(p[0]);
        else    tmpl.pb(p[0]);
    }
    memset(vis, 0, sizeof(vis));
    for(int x : tmpl)   vis[x] = 1;
    for(int x : tmpr)   vis[x] = 2;
    for(int x : tmp)    if(!vis[x]) vis[dsu.find(x)] == 1 ? tmpl.pb(x) : tmpr.pb(x);
    solve(l, mid, tmpl), solve(mid + 1, r, tmpr);
}
int main() {
    #ifdef Kelly
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        freopen("err.txt", "w", stderr);
    #endif
    cin >> n;
    #ifdef Kelly
        for(int i = 1; i <= n; ++i) n <= 10 ? void(cin >> b[i]) : void(b[i] = i);
        if(n > 10) {
            shuffle(b + 1, b + n + 1, rnd);
            for(int i = 1; i <= n; ++i) cerr << b[i] << " ";
            cerr << "\n";
        }
    #endif
    vector<int> tmp;
    for(int i = 1; i <= n; ++i) tmp.pb(i);
    solve(1, n, tmp);
    cout << "1 ";
    for(int i = 1; i <= n; ++i) cout << a[i] << " ";
    cout << endl;
    #ifdef Kelly
        cerr << T << "\n";
        for(int i = 1; i <= n; ++i) if(a[i] != b[i])    cerr << i << "\n";
    #endif
    return 0;
}