#include "monster.h"
#include<bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define mp make_pair
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
template<typename T,typename U>
T ceil(T x, U y) {return (x>0?(x+y-1)/y:x/y);}
template<typename T,typename U>
T floor(T x, U y) {return (x>0?x/y:(x-y+1)/y);}
template<class T,class S>
bool chmax(T &a,const S b) {return (a<b?a=b,1:0);}
template<class T,class S>
bool chmin(T &a,const S b) {return (a>b?a=b,1:0);}
int popcnt(int x) {return __builtin_popcount(x);}
int popcnt(ll x)  {return __builtin_popcountll(x);}
int topbit(int x) {return (x==0?-1:31-__builtin_clz(x));}
int topbit(ll x)  {return (x==0?-1:63-__builtin_clzll(x));}
int lowbit(int x) {return (x==0?-1:__builtin_ctz(x));}
int lowbit(ll x)  {return (x==0?-1:__builtin_ctzll(x));}

#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
typedef pair<int,int> pii; 
typedef vector<int> vi;
typedef vector<pii> vp;
typedef tuple<int,int,int> tiii;
int read() {
  int x=0,w=1; char c=getchar(); 
  while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
  while(isdigit(c)) {x=x*10+(c-'0'); c=getchar();}
  return x*w;
}

namespace {
  const int N=1005;
  int deg[N];
  bool e[N][N];
}

vi Solve(int n) {
  rep(i,0,n-1) rep(j,i+1,n-1) {
    e[i][j]=Query(i,j), e[j][i]=!e[i][j];
    if(e[i][j]) deg[i]++;
    else deg[j]++;
  }
  vi p(n),q(n);
  rep(i,0,n-1) {
    if(deg[i]==1) {
      if(!p[0]) p[0]=i;
      else p[1]=i;
    } else if(deg[i]==n-2) {
      if(!p[n-1]) p[n-1]=i;
      else p[n-2]=i;
    } else p[deg[i]]=i;
  }
  if(!e[p[0]][p[1]]) swap(p[0],p[1]);
  if(!e[p[n-2]][p[n-1]]) swap(p[n-2],p[n-1]);
  rep(i,0,n-1) q[p[i]]=i;
  return q;
}