#include "monster.h"
#include <bits/stdc++.h>
#define ent '\n'

using namespace std;
typedef long long ll;

vector<int> Solve(int n) {
   vector<int> p = {0}, ans(n);
   for(int i = 1; i < n; i++) {
       int pos = -1;
       for(int l = 0, r = i - 1; l <= r;) {
           int mid = l + r >> 1;
           if(Query(i, p[mid])) {
               l = mid + 1;
               pos = mid;
           }
           else r = mid - 1;
       }
       vector<int> nw;
       for(int i = 0; i <= pos; i++) {
           nw.push_back(p[i]);
       }
       nw.push_back(i);
       for(int i = pos + 1; i < p.size(); i++) {
           nw.push_back(p[i]);
       }
       p.swap(nw);
   }
   for(int i = 0; i < n; i++) {
       int pos = i + 1;
       for(int l = i + 2, r = n - 1; l <= r;) {
           int mid = l + r >> 1;
           if(Query(p[i], p[mid])) {
               pos = mid;
               l = mid + 1;
           }
           else r = mid - 1;
       }
       reverse(p.begin() + i, p.begin() + pos + 1);
       i = pos;
   }
   for(int i = 0; i < n; i++) {
       ans[p[i]] = i;
   }
   return ans;
}