#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n;
vector<int> fa;
vector<int> a;

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

void calc(int l,int r){
    if(l==r)return;
    vector<int> qu(n+1);
    int m=(l+r)/2;
    for(int i=1;i<=l-1;i++)qu[i]=a[l];
    for(int i=r+1;i<=n;i++)qu[i]=a[l];

    queue<int> u;
    for(int i=l;i<=r;i++){
        u.push(a[i]);
        fa[a[i]]=a[i];
    }
    int l0=l,r0=r;
    while (u.size()>=2){
        int x=u.front();u.pop();
        int y=u.front();u.pop();
        for(int i=l;i<=m;i++)qu[i]=x;
        for(int i=m+1;i<=r;i++)qu[i]=y;
        // cerr<<x<<" "<<y<<"\n";
        
        cout<<"0 ";
        for(int i=1;i<=n;i++)cout<<qu[i]<<" ";
        cout<<endl;

        int t;cin>>t;
        if(t==0){
            for(int i=l0;i<=r0;i++){
                if(find(a[i])==find(x)){
                    swap(a[i],a[r0]);
                    r0--;
                    i--;
                }
                else if(find(a[i])==find(y)){
                    swap(a[i],a[l0]);
                    l0++;
                }
            }
        }
        else if(t==2){
            for(int i=l0;i<=r0;i++){
                if(find(a[i])==find(x)){
                    swap(a[i],a[l0]);
                    l0++;
                }
                else if(find(a[i])==find(y)){
                    swap(a[i],a[r0]);
                    r0--;
                    i--;
                }
            }
        }
        else{
            fa[find(x)]=find(y);
            u.push(y);
        }
    }
    calc(l,m);
    calc(m+1,r);
}

void solve(){
    mt19937_64 gen(time(NULL));
    cin>>n;

    a.resize(n+1);
    fa.resize(n+1);

    for(int i=1;i<=n;i++)a[i]=i;
    shuffle(a.begin()+1,a.end(),gen);

    calc(1,n);
    cout<<"1 ";
    for(int i=1;i<=n;i++)cout<<a[i]<<" ";
    cout<<endl;
}

int main(){
    int n=1;
    //cin>>n;
    while(n--)solve();
    return 0;
}