#include "monster.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
vector<int>ans;
bool cmp(const int &x,const int &y){
return Query(y,x);
}
vector<int> Solve(int N){
int n = N;
ans.pb(0);
for(int i=1;i<n;i++){
int p = lb(all(ans),i,cmp)-ans.begin();
ans.pb(0);
for(int j=sz(ans)-1;j>p;j--)ans[j] = ans[j-1];
ans[p] = i;
}
vector<int>a;
for(int i=0;i<min(10,n);i++)a.pb(ans[i]);
vector<int>cnt(100);
for(int i=0;i<sz(a);i++){
for(int j=0;j<sz(a);j++){
if(i==j)continue;
if(Query(a[i],a[j]))cnt[i]++;
}
}
vector<int>b;
for(int i=0;i<sz(a);i++){
if(cnt[i] == 1)b.pb(i);
}
int zero = 0;
if(Query(ans[b[0]],ans[b[1]]))zero = b[0];
else zero = b[1];
reverse(ans.begin(),ans.begin()+zero+1);
for(int i=zero+1;i<n;){
int j = i;
while(j<n && !Query(ans[i-1],ans[j]))j++;
reverse(ans.begin()+i,ans.begin()+j+1);
i=j+1;
}
vector<int>fin(n);
for(int i=0;i<n;i++)fin[ans[i]]= i;
return fin;
}
