#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int n, a[1050], p[1050], f[1050];
int F(int x) { return x == f[x] ? x : f[x] = F(f[x]); }
void S(int l, int r, vector<int> v)
{
    if (l == r)
    {
        a[l] = v[0];
        return;
    }
    random_shuffle(v.begin(), v.end());
    int m = l + r >> 1, o = v.back();
    vector<int> _v = v;
    for (auto i : v)
        f[i] = p[i] = 0;
    while (v.size() >= 2)
    {
        int x = v.back();
        v.pop_back();
        int y = v.back();
        v.pop_back();
        printf("0 ");
        for (int i = 1; i < l; ++i)
            printf("%d ", o);
        for (int i = l; i <= m; ++i)
            printf("%d ", x);
        for (int i = m + 1; i <= r; ++i)
            printf("%d ", y);
        for (int i = r + 1; i <= n; ++i)
            printf("%d ", o);
        puts("");
        fflush(stdout);
        int _;
        scanf("%d", &_);
        if (_ == 2)
            p[f[x] = x] = 1, p[f[y] = y] = 2;
        else if (_ == 0)
            p[f[x] = x] = 2, p[f[y] = y] = 1;
        else
            f[x] = y, v.push_back(y);
    }
    if (v.size() == 1)
    {
        int x = v.back(), y = o;
        printf("0 ");
        for (int i = 1; i < l; ++i)
            printf("%d ", o);
        for (int i = l; i <= m; ++i)
            printf("%d ", x);
        for (int i = m + 1; i <= r; ++i)
            printf("%d ", y);
        for (int i = r + 1; i <= n; ++i)
            printf("%d ", o);
        puts("");
        fflush(stdout);
        int _;
        scanf("%d", &_);
        if (_ == 2)
            p[f[x] = x] = 1, p[f[y] = y] = 2;
        else if (_ == 0)
            p[f[x] = x] = 2, p[f[y] = y] = 1;
        else
            f[x] = y;
    }
    vector<int> a, b;
    for (auto i : _v)
    {
        p[i] = p[F(i)];
        if (p[i] & 1)
            a.push_back(i);
        else
            b.push_back(i);
    }
    S(l, m, a), S(m + 1, r, b);
}
int main()
{
    scanf("%d", &n);
    vector<int> v;
    for (int i = 1; i <= n; ++i)
        v.push_back(i);
    S(1, n, v);
    printf("1 ");
    for (int i = 1; i <= n; ++i)
        printf("%d ", a[i]);
    puts("");
    fflush(stdout);
    return 0;
}