#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<random>

#define fi first
#define se second
#define mkp std::make_pair
using ll=long long;
using llu=unsigned long long;
using std::max;
using std::min;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}

const int NV=1e3;

std::mt19937 rnd(19840108);
int N,a[NV+5];
int que(){
    putchar('0');
    for(int i=1;i<=N;++i) printf(" %d",a[i]);
    puts("");
    fflush(stdout);
    int x;
    scanf("%d",&x);
    return x;
}

namespace xm{
    int ans[NV+5];
    void slv(std::vector<int> po,std::vector<int> va){
        if(po.size()==1){
            ans[po[0]]=va[0];
            return;
        }
        int mid=po.size()/2;
        std::vector<int> lp(po.begin(),po.begin()+mid);
        std::vector<int> rp(po.begin()+mid,po.end());
        for(int i=1;i<=N;++i) a[i]=va[0];
        std::vector<int> v1,v2,st;
        std::shuffle(va.begin(),va.end(),rnd);
        for(int i=0;i<(int)va.size();++i){
            if(st.empty()){
                st.push_back(va[i]);
                continue;
            }
            for(int p:lp) a[p]=st.front();
            for(int p:rp) a[p]=va[i];
            int ret=que();
            if(ret!=1){
                for(int p:st) (ret==2?v1:v2).push_back(p);
                (ret==2?v2:v1).push_back(va[i]);
                st.clear();
            }else st.push_back(va[i]);
        }
        if(lp.size()!=v1.size()) for(int p:st) v1.push_back(p);
        else for(int p:st) v2.push_back(p);
        slv(lp,v1);
        slv(rp,v2);
    }void _(){
        scanf("%d",&N);
        std::vector<int> po,va;
        for(int i=1;i<=N;++i){
            po.push_back(i);
            va.push_back(i);
        }
        slv(po,va);
        putchar('1');
        for(int i=1;i<=N;++i) printf(" %d",ans[i]);
        puts("");
        fflush(stdout);
    }
}

int main(){
    xm::_();
    return 0;
}