#include "game.h"
#include <bits/stdc++.h>
#define rep(i, n) for(ll i = 0; i < ll(n); ++i)
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); ++i)
#define rrep(i, n) for(ll i = ll(n) - 1; i >= 0; --i)
#define rrep2(i, n, t) for(ll i = ll(n) - 1; i >= ll(t); --i)
#define pb push_back
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define SZ(a) int(a.size())
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;
const int inf = 1001001001;
const ll linf = 1001001001001001001;
template<class T>
bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T>
bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int n;
vi r;
vb is_r;
vvi cnt;
void initialize(int N) {
n = N;
r.resize(n);
iota(all(r), 0);
is_r.assign(n, true);
cnt.assign(n, vi(n, 1));
}
int hasEdge(int u, int v) {
u = r[u];
v = r[v];
assert(u != v);
if (cnt[u][v] > 1) {
--cnt[u][v];
--cnt[v][u];
return 0;
} else {
rep(i, n) if (r[i] == v) r[i] = u;
is_r[v] = false;
rep(i, n) {
if (is_r[i] and i != u) {
cnt[i][u] = cnt[u][i] += cnt[v][i];
}
}
return 1;
}
}
