#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int B=2) {
	return (unsigned long long)rng() % B;
}
const bool rand_test=false;
struct Interactor{
    int n;
    vector<int> a;
    int tot=0;
    void init(int _n){
        n=_n;
        tot=0;
        if(rand_test){
            a.resize(n+1);
            for(int i=1;i<=n;i++)a[i]=i;
            random_shuffle(a.begin()+1,a.end());
            cout<<"random_a : ";for(int i=1;i<=n;i++)cout<<a[i]<<" ";;cout<<endl;
        }
    }
    int query(vector<int> b){
        tot++;
        assert(tot<=6666);
        cout<<"0 "<<b[1];
        for(int i=2;i<=n;i++)cout<<" "<<b[i];
        cout<<endl;
        if(rand_test){
            int cnt=0;
            for(int i=1;i<=n;i++)cnt+=(a[i]==b[i]);
            return cnt;
        }
        int z;cin>>z;return z;
    }
    void answer(vector<int>b){
        cout<<"1 "<<b[1];
        for(int i=2;i<=n;i++)cout<<" "<<b[i];
        cout<<endl;
        if(rand_test){
            int cnt=0;
            for(int i=1;i<=n;i++)cnt+=(a[i]==b[i]);
            assert(cnt==n);
            cout<<"tot="<<tot<<endl;
        }
        
    }
}sol;
int solve()
{
    srand(time(NULL));
    int n;
    if(rand_test)n=1000;
    else cin>>n;
    sol.init(n);
    if(n<=5){
        vector<int>ans(n+1);
        iota(ans.begin(),ans.end(),0);
        do{
            if(sol.query(ans)==n){
                sol.answer(ans);
                return 0;
            }
        }while(next_permutation(ans.begin()+1,ans.end()));
        return 0;
    }
    // int zero=2;
    // for(int i=1;i<=n;i++)if(i!=2){
    //     vector<int> b(n+1);
    //     b[1]=i;
    //     for(int j=2;j<=n;j++)b[j]=2;
    //     int q=sol.query(b);
    //     if(q==0)break;
    //     if(q==2){zero=i;break;}
    // }
    vector<int>ans(n+1);
    // ans[1]=zero;
    // cout<<"zero = "<<zero<<endl;
    auto zero = [&](int a,int b){
        for(int i=1;i<=n;i++)if(i!=a&&i!=b)return i;
        return -1;
    };
    function<void(int,int,vector<int>)> dfs = [&](int l,int r,vector<int>a){
        random_shuffle(a.begin(),a.end());
        // cout<<"dfs l ="<<l<<" r="<<r<<" a :";for(auto it:a)cout<<it<<" ";;;cout<<endl;
        if(r-l+1==1){
            ans[l]=a.back();
            return;
        }
        if(r-l+1==2){
            vector<int>b(n+1,a[0]);
            b[r]=zero(a[0],a[1]);
            if(sol.query(b)==1){
                ans[l]=a[0],ans[r]=a[1];
            }
            else ans[l]=a[1],ans[r]=a[0];
            return;
        }
        int mid=(l+r)/2;
        vector<int>L,R;
        vector<int> v;
        for(int i=0;i<(int)a.size();i++){
            v.push_back(a[i]);
            while(i+1<a.size()){
                int t[2]={v.back(),a[i+1]};
                vector<int> b(n+1);
                for(int j=1;j<=n;j++){
                    if(j>=l&&j<=mid)b[j]=t[0];
                    else if(j>mid&&j<=r)b[j]=t[1];
                    else b[j]=t[0];
                }
                int q=sol.query(b);
                if(q==2){
                    for(auto it:v)L.push_back(it);
                    R.push_back(t[1]);
                    v.clear();
                    i++;
                    break;
                }
                else if(q==0){
                    L.push_back(t[1]);
                    for(auto it:v)R.push_back(it);
                    v.clear();
                    i++;
                    break;
                }
                else{
                    v.push_back(a[i+1]);
                    i++;
                }
            }
        }
        if(!v.empty()){
            if(L.size()<mid-l+1){
                for(auto it:v)L.push_back(it);
            }
            else {
                for(auto it:v)R.push_back(it);
            }
        }
        dfs(l,mid,L);
        dfs(mid+1,r,R);
    };
    vector<int> b(n);iota(b.begin(),b.end(),1);
    dfs(1,n,b);
    sol.answer(ans);
    return 0;
}
int main()
{
    int T=1;;
    while(T--)solve();
}