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

using namespace std;

int a[1050][1050];

vector<int> Solve(int n) {
    vector<int> ans(n), used(n), pos(n);
    for(int i = 0; i < n; i++) {
        for(int j = i + 1; j < n; j++) {
            a[i][j] = Query(i, j);
            a[j][i] = 1 - a[i][j];
        }
    }
    int cnt = n, p0 = -1, p1 = -1, pn = -1, pm = -1;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < n; j++) {
            if(i != j) {
                ans[i] += a[i][j];
            }
        }
        pos[ans[i]] = i;
        if(ans[i] == 1) {
            p1 = i;
            if(p0 < 0) p0 = i;
        }
        if(ans[i] == n - 2) {
            pm = i;
            if(pn < 0) pn = i;
        }
    }
    if(n == 4) {
        if(!a[p0][pn] && !a[p0][pm]) {
            ans[p1]--;
        }
        else {
            ans[p0]--;
        }

        if(a[pn][p0] && a[pn][p1]) {
            ans[pn]++;
        }
        else {
            ans[pm]++;
        }
    }
    else {
        if(a[p0][pos[2]]) {
            ans[p1]--;
        }
        else {
            ans[p0]--;
        }

        if(a[pos[n - 3]][pn]) {
            ans[pm]++;
        }
        else {
            ans[pn]++;
        }
    }
    return ans;
}