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

// #define int long long
#define ls (p<<1)
#define rs (p<<1|1)
#define mid ((l+r)>>1)
#define all(_array) (_array).begin(),(_array).end()
#define msp(_array) memset(_array,0x3f,sizeof _array)
#define ms0(_array) memset(_array,0,sizeof _array)
#define msn(_array) memset(_array,-1,sizeof _array)
#define mc(_tar,_array) memcpy(_tar,_array,sizeof _tar)
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define TAK cout<<"TAK"<<endl
#define NIE cout<<"NIE"<<endl
#define OK cerr<<"OK"<<endl
#define pii pair<int,int>
// #define endl '\n'

bool bg_memory;
mt19937 rnd(time(0));
int Case=1;
const int mod=1e9+7;
const int inf=2147483647;
const int bs=233;
const double eps=1e-6;
const int N=1e3+7,M=1e5+7;

template<class _t1,class _t2>inline void cmax(_t1 &a,_t2 b){a=a<b?b:a;}
template<class _t1,class _t2>inline void cmin(_t1 &a,_t2 b){a=a>b?b:a;}
inline int qp(int a,int b,int p=mod){int res=1;while(b){if(b&1)res=1ll*res*a%p;a=1ll*a*a%p;b>>=1;}return res;}
inline int sqrt(int x,int r){int l=0,ans=0;while(l<=r){if(1ll*mid*mid<=x) ans=mid,l=mid+1;else r=mid-1;}return ans;}

int n;
int id[N];
int ans[N],qu[N];
int T[N],Tot;
vector<int> v;
int ask(int l,int r,int a,int b){
    for(int i=r+1;i<=n;i++) qu[id[i]]=b;
    for(int i=1;i<=r;i++) qu[id[i]]=a;
    cout<<"0 ";
    for(int i=1;i<=n;i++) cout<<qu[i]<<" ";
    cout<<endl;
    int tmp=0;
    // for(int i=1;i<=n;i++) tmp+=(T[i]==qu[i]);
    // Tot++;
    cin>>tmp;
    return tmp;
}
void solve(int l,int r,vector<int> v){
    // cout<<l<<" "<<r<<endl;
    // for(int i:v) cout<<i<<" ";
    // cout<<endl<<tmp<<endl;
    shuffle(all(v),rnd);
    if(l==r) return ans[id[l]]=v.back(),void();
    vector<int> L,R,unk;
    for(int i:v){
        if(L.size()==mid-l+1){
            R.push_back(i);
            continue;
        }else if(R.size()==r-mid){
            L.push_back(i);
            continue;
        }
        if(!unk.size()){
            unk.push_back(i);
            continue;
        }
        int res=ask(l,mid,i,unk.back());
        if(res==2){
            L.push_back(i);
            for(int j:unk) R.push_back(j);
            unk.clear();
        }else if(res==0){
            R.push_back(i);
            for(int j:unk) L.push_back(j);
            unk.clear();
        }else unk.push_back(i);
    }
    // cout<<L.size()<<" "<<R.size()<<" "<<unk.size()<<endl;
    if(L.size()+unk.size()==mid-l+1) for(int j:unk) L.push_back(j);
    else for(int j:unk) R.push_back(j);
    // cout<<l<<" "<<r<<" "<<Tot<<endl;
    solve(l,mid,L);
    solve(mid+1,r,R);
}

void Main(){
    
    // n=1000;
    cin>>n;
    // for(int i=1;i<=n;i++) T[i]=i;
    // shuffle(T+1,T+n+1,rnd);
    for(int i=1;i<=n;i++) id[i]=i,v.push_back(i);
    shuffle(id+1,id+n+1,rnd);
    solve(1,n,v);
    cout<<"1 ";
    for(int i=1;i<=n;i++) cout<<ans[i]<<" ";
    // cout<<Tot<<endl;
    return;
}
string RdFile="";
bool en_memory;

signed main(){
    auto bg_clock=chrono::high_resolution_clock::now();
#ifdef ONLINE_JUDGE
    // freopen((RdFile+".in").c_str(),"r",stdin);
    // freopen((RdFile+".out").c_str(),"w",stdout);
#endif
    // ios::sync_with_stdio(0);
    // cin.tie(0);
    // cout.tie(0);
    // cin>>Case;
    while(Case--) Main();
    auto en_clock=chrono::high_resolution_clock::now();
    auto duration_clock=chrono::duration_cast<chrono::microseconds>(en_clock-bg_clock);
    double duration_count=duration_clock.count()*0.001;
    double memory_used=(&en_memory-&bg_memory)/1024.0/1024;
    // cerr<<"Time:"<<duration_count<<"ms"<<endl;
    // cerr<<"Memory: "<<memory_used<<"MB"<<endl;
    return 0;
}