#include "sphinx.h"
#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
  if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
  if(x > y) x = y;
}

inline int popcnt(int x){
  return __builtin_popcount(x);
}

inline int ctz(int x){
  return __builtin_ctz(x);
}
int n;
vector <int> G[255],ans;
int fa[255];
int fnd(int u){
    if(fa[u] == u) return u;
    return fa[u] = fnd(fa[u]);
}
void mrg(int u,int v){
    u = fnd(u);v = fnd(v);
    if(u == v) return;
    fa[u] = v;
}

int test(vector <int> &C){
    rep(u,1,n) fa[u] = u;
    rep(u,1,n){
        for(int v:G[u]){
            if(C[u - 1] == C[v - 1]) mrg(u,v);
        }
    }
    int result = 0;
    rep(u,1,n) result += fa[u] == u;
    return result;
}

int test(vector <int> C,int l,int r){
    rep(u,1,l - 1) C[u - 1] = n;
    rep(u,r + 1,n) C[u - 1] = n;
    return test(C);
}

int query(vector <int> &C){
    assert(SZ(C) == n);
    int ret = perform_experiment(C);
//    for(int c:C) printf("%d ",c);
//    printf("ret=%d\n",ret);
    return ret;
}

int query(vector <int> C,int l,int r){
    rep(u,1,l - 1) C[u - 1] = n;
    rep(u,r + 1,n) C[u - 1] = n;
    return query(C);    
}

void trans(int x,int y){
    for(int &c:ans) if(c == x) c = y;
}

vector <int> find_colours(int N, vector<int> X,vector<int> Y) {
    n = N;
    rep(i,0,SZ(X) - 1){
        X[i]++;Y[i]++;
        G[X[i]].eb(Y[i]);G[Y[i]].eb(X[i]);
    }
    vector <int> C(n);
    ans = vector<int>(n,n);
    rep(u,1,n){
        rep(v,1,u) C[v - 1] = -1; 
        rep(v,u + 1,n) C[v - 1] = n;
        int bas = query(C);
        ans[u - 1] = u;
/*        printf("curans=\n");
        rep(v,1,n) printf("%d ",ans[v - 1]);
        printf("\n");*/
        while(test(ans) != bas){
            int l = 1,r = n,mid;
            while(l != r){
                mid = (l + r) >> 1;
                if(test(ans,l,mid) > query(C,l,mid)) r = mid;
                else l = mid + 1;
            }
            trans(ans[u - 1],ans[l - 1]);
        }
    }
    return ans;
}
/*
g++ sphinx4.cpp grader.cpp -o grader4.exe -Wall -Wshadow -O2 -std=c++14
*/