#include<bits/stdc++.h>
#ifdef LOCAL
#include "Essentials/algo/debug.h"
#else
#define debug(...) 69
#endif
#include "game.h"
using namespace std;
//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//https://quera.org/profile/4dykhk
typedef long long ll;
typedef long double ldb;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int N = 2e3 + 23;
const int sq = 450;
const ll mod = 1e9+7; // 998244353
const int LOG = 23;
const ll inf = 1e18;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define F first
#define S second
#define pb push_back
#define ms(x,y) memset((x) , (y) , sizeof (x))
#define done return cout<<endl , 0;
#define kill(x) cout<<x<<endl, exit(0);
#define isIn(x,s,e) ((x) >= (s) && (x) <= e)
#define all(x) x.begin(),x.end()
#define sz(x) (int)x.size()
#define pc(x) __builtin_popcount(x)
#define ctz(x) __builtin_ctz(x)
#define MinHeap(x) priority_queue<x, vector<x> , greater<x> >
#define MaxHeap(x) priority_queue<x, vector<x>>
#define lc (v << 1)
#define rc ((v<<1) |1)
//#define int ll
ll pw(ll a, ll b, ll md = mod){ll res = 1; while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}
int n;
int par[N];
int s[N];
int e[N][N];
int getPar(int v) {
return par[v] == v ? v : par[v] = getPar(par[v]);
}
int hasEdge(int v, int u) {
v = getPar(v) , u = getPar(u);
assert(v != u);
e[v][u] ++;
e[u][v] ++;
if(e[v][u] == s[v] * s[u]) {
for(int i = 0 ; i < n ; i++) {
if(i != v && i != u)
e[v][i] += e[u][i];
}
par[u] = v;
s[v] += s[u];
return 1;
}
return 0;
}
void initialize(int nn) {
n = nn;
for(int i = 0 ; i <n ; i++) par[i] = i,s[i] = 1;
}
