#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "game.h"
int n;
bool del[2000][2000];
VVI gp;
void initialize(int N) {
n = N;
gp = VVI(n);
}
set<int> compret;
void dfs(int u, int p = -1) {
compret.insert(u);
for (int v : gp[u]) if (v != p) dfs(v, u);
}
set<int> comp(int u) {
compret = set<int>();
dfs(u);
return compret;
}
int hasEdge(int u, int v) {
set<int> a = comp(u);
set<int> b = comp(v);
if (a == b) return false;
bool sepa, sepb;
int cnt;
cnt = 0;
for (int u : a) rep(v, n) if (!a.count(v)) {
if (!del[u][v]) cnt++;
}
sepa = (cnt == 1);
cnt = 0;
for (int u : b) rep(v, n) if (!b.count(v)) {
if (!del[u][v]) cnt++;
}
sepb = (cnt == 1);
if (sepa || sepb) {
gp[u].pb(v);
gp[v].pb(u);
return true;
}
del[u][v] = del[v][u] = true;
return false;
}
