#include "monster.h"
#include <iostream>
#include <algorithm>
#include <cstring>

typedef long long ll;
typedef double lf;

// #define DEBUG 1
struct IO
{
    #define MAXSIZE (1 << 20)
    #define isdigit(x) (x >= '0' && x <= '9')
    char buf[MAXSIZE], *p1, *p2;
    char pbuf[MAXSIZE], *pp;
    #if DEBUG
    #else
    IO() : p1(buf), p2(buf), pp(pbuf) {}
    ~IO() {fwrite(pbuf, 1, pp - pbuf, stdout);}
    #endif
    #define gc() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, MAXSIZE, stdin), p1 == p2) ? ' ' : *p1++)
    #define blank(x) (x == ' ' || x == '\n' || x == '\r' || x == '\t')

    template <typename T>
    void Read(T &x)
    {
        #if DEBUG
        std::cin >> x;
        #else
        bool sign = 0; char ch = gc(); x = 0;
        for (; !isdigit(ch); ch = gc())
            if (ch == '-') sign = 1;
        for (; isdigit(ch); ch = gc()) x = x * 10 + (ch ^ 48);
        if (sign) x = -x;
        #endif
    }
    void Read(char *s)
    {
        #if DEBUG
        std::cin >> s;
        #else
        char ch = gc();
        for (; blank(ch); ch = gc());
        for (; !blank(ch); ch = gc()) *s++ = ch;
        *s = 0;
        #endif
    }
    void Read(char &c) {for (c = gc(); blank(c); c = gc());}

    void Push(const char &c)
    {
        #if DEBUG
        putchar(c);
        #else
        if (pp - pbuf == MAXSIZE) fwrite(pbuf, 1, MAXSIZE, stdout), pp = pbuf;
        *pp++ = c;
        #endif
    }
    template <typename T>
    void Write(T x)
    {
        if (x < 0) x = -x, Push('-');
        static T sta[35];
        int top = 0;
        do sta[top++] = x % 10, x /= 10; while (x);
        while (top) Push(sta[--top] ^ 48);
    }
    template <typename T>
    void Write(T x, char lst) {Write(x), Push(lst);}
} IO;
#define Read(x) IO.Read(x)
#define Write(x, y) IO.Write(x, y)
#define Put(x) IO.Push(x)

using namespace std;

const int MAXN = 1010;

int n;

int cpr[MAXN][MAXN];
inline bool cmp(int x, int y)
{
    // cerr << x << " " << y << "\n";
    if (~cpr[x][y]) return cpr[x][y];
    bool cur = Query(x - 1, y - 1);
    cpr[x][y] = !cur, cpr[y][x] = cur;
    return !cur;
}

int a[MAXN], b[MAXN];
inline void Merge(int l, int r)
{
    if (l == r) return;
    int mid = l + r >> 1;
    Merge(l, mid), Merge(mid + 1, r);
    // cerr << "Merge " << l << " " << r << "\n";
    // for (int i = l; i <= mid; i++) cerr << a[i] << ' '; cerr << "\n";
    // for (int i = mid + 1; i <= r; i++) cerr << a[i] << ' '; cerr << "\n";
    for (int i = l, j = l, k = mid + 1; i <= r; i++)
        if (j > mid || (k <= r && cmp(a[k], a[j]))) b[i] = a[k++];
        else b[i] = a[j++];
    for (int i = l; i <= r; i++) a[i] = b[i];
    // for (int i = l; i <= r; i++) cerr << a[i] << ' '; cerr << '\n';
}
int deg[20];

vector <int> Solve(int N)
{
    n = N;
    memset(cpr, -1, sizeof(cpr));
    for (int i = 1; i <= n; i++) a[i] = i;
    Merge(1, n);
    int m = min(n, 10);
    for (int i = 1; i <= m; i++)
        for (int j = i + 1; j <= m; j++)
            deg[i] += cmp(a[i], a[j]), deg[j] += cmp(a[j], a[i]);
    int mx = 0;
    for (int i = 1; i <= m; i++) mx = max(mx, deg[i]);
    int p0[2], tot = 0;
    for (int i = 1; i <= m; i++) if (deg[i] == mx) p0[tot++] = i;
    if (tot == 2 && cmp(a[p0[0]], a[p0[1]])) p0[0] = p0[1];
    vector <int> ans(n);
    int lst = 1, pre = p0[0], top = 0;
    
    // cerr << p0[0] << '\n';
    for (int i = p0[0]; i >= 1; i--) ans[a[i] - 1] = top++;
    for (int i = p0[0] + 1; i <= n; i++)
        if (cmp(a[i], a[lst]))
        {
            for (int j = i; j > pre; j--) ans[a[j] - 1] = top++;
            lst = pre + 1, pre = i;
        }
    // for (auto x : ans) cerr << x << " ";
    return ans;
}