#include "game.h"
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define ll long long
using namespace std;
int p[2005],sz[2005],a[2005][2005],n;
int find_set(int a){
if (p[a]==a) return a;
return p[a]=find_set(p[a]);
}
void dsu(int a,int b){
a=find_set(a);
b=find_set(b);
if (a==b) return ;
if (sz[a]<sz[b]) swap(a,b);
p[b]=a; sz[a]+=sz[b];
}
void initialize(int n) {
for (int i=0; i<=n; i++) {
p[i]=i; sz[i]=1;
}
for (int i=0; i<=n; i++){
for (int j=0; j<=n; j++) a[i][j]=1;
}
}
int hasEdge(int u, int v) {
u=find_set(u);
v=find_set(v);
if (u>v) swap(u,v);
if (a[u][v]>1){
a[u][v]--; a[v][u]=a[u][v];
return 0;
}
dsu(u,v);
int x=find_set(u);
// cout<<u<<" "<<v<<" "<<x<<endl;
for (int i=x+1; i<n; i++){
a[x][i]=a[u][i]+a[v][i]; a[i][x]=a[x][i];
}
return 1;
}
/*
int main() {
int u, v;
cin >> n;
initialize(n);
for (int i = 0; i < n * (n - 1) / 2; i++) {
cin >> u >> v;
printf("%d\n", hasEdge(u, v));
}
return 0;
}*/
