#include <bits/stdc++.h>
using namespace std;
mt19937 rng(42);
vector<int> cor;
vector<int> BRR;
int ask(vector<int> &q){
    cout << "0 ";
    for(int i : q){
        cout << i << " ";
    }
    cout << endl;
    int ret = 0;
    cin >> ret;
    return ret;
}

void distribute(vector<int> &arr, vector<int> &brr, vector<int> &posl, vector<int> &posr){
    int l = brr.back();
    while(arr.size()){
        if(l){
            posr.push_back(arr.back());
        }
        else{
            posl.push_back(arr.back());
        }
        arr.pop_back();
        brr.pop_back();
    }
}

void rec(int L, int R, vector<int> &pos, int N){
    if(pos.size() == 1){
        cor[L] = pos[0];
        return;
    }
    vector<int> posl, posr;
    int mid = (L + R) / 2;
    vector<int> arr;
    vector<int> quest;
    for(int i : pos){
        if(arr.size() == 0){
            arr.push_back(i);
            quest.push_back(rng() % 2);
        }
        else if(arr.size() >= 1){
            int a = arr.back();
            arr.pop_back();
            int b = i;
            int ca = quest.back();
            quest.pop_back();
            int cb = ca ^ 1;
            fill(BRR.begin(), BRR.end(), a);
            if(cb){
                for(int j = mid; j < R; j ++){
                    BRR[j] = b;
                }
            }
            else{
                for(int j = L; j < mid; j ++){
                    BRR[j] = b;
                }
            }
            int ans = ask(BRR);
            if(ans == 0){
                swap(ca, cb);
            }
            arr.push_back(a);
            quest.push_back(ca);
            if(ans % 2 == 0){
                if(cb){
                    posr.push_back(b);
                }
                else{
                    posl.push_back(b);
                }
                distribute(arr, quest, posl, posr);
            }
            else{
                arr.push_back(b);
                quest.push_back(cb);
            }
        }
    }
    if(quest.size() && mid - L == posl.size() + arr.size()){
        quest.back() = 0;
        distribute(arr, quest, posl, posr);
    }
    else if(quest.size()){
        quest.back() = 1;
        distribute(arr, quest, posl, posr);
    }
    rec(L, mid, posl, N);
    rec(mid, R, posr, N);
}

void answer(){
    cout << 1 << " ";
    for(int i : cor){
        cout << i << " ";
    }
    cout << endl;
}

void solve(){
    int N;
    cin >> N;
    int L = 0, R = N;
    vector<int> pos(N);
    cor.assign(N, -1);
    BRR.assign(N, 1);
    iota(pos.begin(), pos.end(), 1);
    rec(L, R, pos, N);
    answer();
}

int main() {
    solve();
    return 0;
}