#include<cstdio>
#include<algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <cassert>
#include <random>
#include <ctime>
#define ABS(X) ((X)>=0?(X):-(X))
#define LPos(X) Tree[Pos].Son[0]
#define RPos(X) Tree[Pos].Son[1]
using namespace std;

using ll = long long;
using ld = long double;

mt19937 Rand(random_device{}());
int N;
int Ans[1001];
int Output[1001];
int Stack[1001],Top;
int Oper()
{
    putchar('0');
    for(int i=1;i<=N;++i)
    printf(" %d",Output[i]);
    putchar('\n');
    fflush(stdout);
    int Res;
    scanf("%d",&Res);
    return Res;
}
void Find()
{
    putchar('1');
    for(int i=1;i<=N;++i)
    printf(" %d",Ans[i]);
    putchar('\n');
    fflush(stdout);
}
void Search(int L,int R,vector<int>Now)
{
    if(Now.size()==1)
    {
        Ans[L]=Now[0];
        return;
    }
    if(Now.size()==2)
    {
        for(int i=1;i<=N;++i)
        Output[i]=(i==R?Now[1]:Now[0]);
        if(Oper()==2)
        {
            Ans[L]=Now[0],Ans[R]=Now[1];
        }
        else Ans[L]=Now[1],Ans[R]=Now[0];
        return;
    }
    shuffle(Now.begin(),Now.end(),Rand);
    vector<int>Next[2];
    int Mid=((L+R)>>1);
    int Lrest=Mid-L+1,Rrest=R-Mid;
    int Pointer=0;
    while(Lrest&&Rrest)
    {
        int Left=Now[Pointer++];
        Top=0;
        while(Pointer<Now.size())
        {
            int Right=Now[Pointer++];
            for(int i=1;i<=N;++i)
            Output[i]=(i>Mid&&i<=R?Right:Left);
            int Op=Oper();
            if(Op==1)
            {
                Stack[++Top]=Right;
            }
            else if(Op==2)
            {
                Next[0].push_back(Left);
                Next[1].push_back(Right);
                for(int i=1;i<=Top;++i)
                Next[0].push_back(Stack[i]);
                Lrest-=Top+1,--Rrest;
                break;
            }
            else
            {
                Next[1].push_back(Left);
                Next[0].push_back(Right);
                for(int i=1;i<=Top;++i)
                Next[1].push_back(Stack[i]);
                Rrest-=Top+1,--Lrest;
                break;
            }
        }
    }
    while(Pointer<Now.size()&&Lrest)
    {
        Next[0].push_back(Now[Pointer++]);
        --Lrest;
    }
    while(Pointer<Now.size()&&Rrest)
    {
        Next[1].push_back(Now[Pointer++]);
        --Rrest;
    }
    Search(L,Mid,Next[0]);
    Search(Mid+1,R,Next[1]);
}
int main()
{
    scanf("%d",&N);
    vector<int>Prime;
    for(int i=1;i<=N;++i)
    {
        Prime.push_back(i);
    }
    Search(1,N,Prime);
    Find();
}