#include <bits/stdc++.h>
#include "monster.h"
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)
int cnt[205];
vector<int> Solve(int N) {
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
bool f = Query(i, j);
if (f) cnt[i]++;
else cnt[j]++;
}
}
int x = -1, y = 0;
for (int i = 0; i < N; i++) {
if (cnt[i] == 1) {
if (x == -1) x = i;
y = i;
}
}
if (Query(x, y)) cnt[x]--;
else cnt[y]--;
x = -1, y = 0;
for (int i = 0; i < N; i++) {
if (cnt[i] == N - 2) {
if (x == -1) x = i;
y = i;
}
}
if (Query(x, y)) cnt[y]++;
else cnt[x]++;
vector<int> ret;
for (int i = 0; i < N; i++) ret.push_back(cnt[i]);
return ret;
}
