#include<bits/stdc++.h>
using namespace std;
#define ll int
#define f(i,a,b) for(int i=a;i<=b;i++)
ll rd(){
	ll x=0,f=1;char c=getchar();
	while(!isdigit(c)){
		if(c=='-')f=-1;
		c=getchar();
	}while(isdigit(c)){
		x=x*10+c-'0';
		c=getchar();
	}return x*f;
}
#define d rd()
ll n;
ll ask(ll x,ll y,ll mid){
    putchar('0');
    f(i,1,mid)printf(" %d",x);
    f(i,mid+1,n)printf(" %d",y);cout<<endl;
    fflush(stdout);
    return d;
}
ll fa[10010];
ll find(ll x){if(fa[x]==x)return x;return fa[x]=find(fa[x]);}
void un(ll u,ll v){fa[find(u)]=find(v);}
ll res[100010];
void work(ll l,ll r,set<ll>st){
    // printf("Now Running: (%d, %d)  ",l,r);
    // cout<<"{";for(auto i:st)cout<<i<<" ";cout<<"}.\n";
    if(l==r){res[l]=*(st.begin());return;}
    ll mid=l+r>>1;
    set<ll>lf,ri,ss;lf.clear(),ri.clear();ss=st;
    for(auto i:st)fa[i]=i;
    ll L=n+1,R=n+2;fa[L]=L,fa[R]=R;
    while(st.size()>1){
        ll x=rand()%(st.size()-1),y=rand()%(st.size()-x-1)+x+1;
        ll xx,yy;
        auto it=st.begin();if(x==0)xx=*it;
        f(i,1,y){++it;
            if(x==i)xx=*it;
            if(y==i)yy=*it;
        }x=xx,y=yy;ll o=ask(x,y,mid);
        if(o==0)un(x,R),un(y,L),st.erase(x),st.erase(y);
        if(o==2)un(x,L),un(y,R),st.erase(x),st.erase(y);
        if(o==1){
            un(x,y);
            st.erase(x);
        }
    }for(auto i:ss){
        if(find(i)==find(L))lf.insert(i);
        else if(find(i)==find(R))ri.insert(i);
    }if(st.size()){
        ll x=*(st.begin());
        if(lf.size()!=(mid-l+1)){
            for(auto i:ss)if(find(i)==find(x))lf.insert(i);
        }
        else {
            for(auto i:ss)if(find(i)==find(x))ri.insert(i);
        }
    }
    work(l,mid,lf);work(mid+1,r,ri);
}
set<ll>st;
int main(){
    srand(time(0));
    n=d;f(i,1,n)st.insert(i);
    work(1,n,st);cout<<1<<" ";
    f(i,1,n)cout<<res[i]<<" ";cout<<endl;
	return 0;
}