#include "monster.h"
#include <bits/stdc++.h>

using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int mem[1001][1001];
int qr(int x, int y) {
    if(mem[x][y] != -1) return mem[x][y];
    int k = Query(x, y);
    mem[x][y] = k;
    mem[y][x] = 1 - k;
    return k;
}
vector<int> Solve(int N) {
    memset(mem, -1, sizeof(mem));
    vector<int> a(N), res(N);
    iota(a.begin(), a.end(), 0);
    auto get = [&](int v) {
        int s = 0;
        for(int i = 0; i < N; i++) if(i != v) {
            if(qr(v, i)) {
                s++;
            }
        }
        return s;
    };
    int x, y, x1, y1;
    x = y = x1 = y1 = -1;
    for(int i = 0; i < N; i++) {
        int s = get(i);
        if(s > 1 && s < N - 2) {
            res[i] = s; 
        } else {
            if(s == 1) {
                if(x == -1) x = i;
                else y = i;
            } else {
                if(x1 == -1) x1 = i;
                else y1 = i;
            }
        }
    }
    if(qr(x, y)) {
        res[x] = 0;
        res[y] = 1;
    } else {
        res[y] = 0;
        res[x] = 1;
    }

    if(qr(x1, y1)) {
        res[x1] = N - 2;
        res[y1] = N - 1;
    } else {
        res[y1] = N - 2;
        res[x1] = N - 1;
    }

    return res;
}