#include "monster.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<int> Solve(int N) {
vector<int> T(N), cnt(N);
for (int i=0;i<N-1;i++){
for (int j=i+1;j<N;j++){
bool tmp = Query(i, j);
if (tmp) cnt[i]++;
else cnt[j]++;
}
}
vector<int> tmp1, tmpn;
for (int i=0;i<N;i++){
if (cnt[i]>1 && cnt[i]<N-2) T[i] = cnt[i];
else if (cnt[i]==1) tmp1.push_back(i);
else tmpn.push_back(i);
}
if (Query(tmp1[0], tmp1[1]))T[tmp1[0]] = 0, T[tmp1[1]] = 1;
else T[tmp1[0]] = 1, T[tmp1[1]] = 0;
if (Query(tmpn[0], tmpn[1])) T[tmpn[0]] = N-2, T[tmpn[1]] = N-1;
else T[tmpn[0]] = N-1, T[tmpn[1]] = N-2;
return T;
}
