// QOJ9432 Permutation
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define rep(i, s, t) for(int i=s; i<=t; ++i)
#define debug(x) cerr<<#x<<":"<<x<<endl;
const int N=1005;
using namespace std;
mt19937 rnd(time(0));
char buf[1<<23], *p1=buf, *p2=buf;
#define gc() getchar()
inline int read()
{
    int x=0, f=1; char c=gc();
    while(c<'0' || c>'9') c=='-' && (f=-1), c=gc();
    while('0'<=c && c<='9') x=(x<<3)+(x<<1)+c-'0', c=gc();
    return x*f;
}

int n, ans[N];
int query(int mid, int x, int y)
{
    printf("0");
    rep(i, 1, mid) printf(" %d", x);
    rep(i, mid+1, n) printf(" %d", y);
    puts(""); fflush(stdout);
    return read();
}
int fa[N];
int root(int u) {return fa[u]==u?u:fa[u]=root(fa[u]);}
void dfs(int l, int r, vector<int> a)
{
    if(l>r) return;
    if(l==r) return ans[l]=a[0], void();
    vector<int> L, R, b, LL, RR;
    for(int x:a) fa[x]=x;
    int mid=l+r>>1;
    shuffle(a.begin(), a.end(), rnd);
    while(a.size()>1)
    {
        int x=a.back(); a.pop_back(); int y=a.back(); a.pop_back();
        int ret=query(mid, x, y);
        if(ret==0) L.pb(y), R.pb(x);
        else if(ret==1) a.pb(x), b.pb(y), fa[root(y)]=root(x);
        else L.pb(x), R.pb(y);
    }
    if(a.size())
    {
        int x=a.back();
        if(L.size())
        {
            int ret=query(mid, L[0], x);
            if(ret==1) L.pb(x);
            else R.pb(x);
        }
        else if(R.size())
        {
            int ret=query(mid, x, R[0]);
            if(ret==1) R.pb(x);
            else L.pb(x);
        }
    }
    LL.clear(), RR.clear();
    for(int x:L)
    {
        for(int y:b) if(root(y)==root(x)) LL.pb(y);
    }
    for(int x:R)
    {
        for(int y:b) if(root(y)==root(x)) RR.pb(y);
    }
    for(int x:LL) L.pb(x);
    for(int x:RR) R.pb(x);
    dfs(l, mid, L), dfs(mid+1, r, R);
}

int main()
{
    n=read(); vector<int> a;
    rep(i, 1, n) a.pb(i);
    dfs(1, n, a);
    printf("1");
    rep(i, 1, n) printf(" %d", ans[i]);

    return 0;
}