/*input
4
0 1
3 0
1 2
0 2
3 1
2 3
*/
#include "game.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
#define ll long long
#define ld long double
#define pii pair<double,double>
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define MP make_pair
const ll INF64=4e12;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll mult(ll a,ll b){
return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b){
if(b<=0) return 1;
ll res=1LL;
while(b){
if(b&1){
res=(res*a)%MOD;
}
a=(a*a)%MOD;
b>>=1;
}
return res;
}
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
int par[maxn],rank1[maxn];
int find(int a){
return a==par[a]?a:par[a]=find(par[a]);
}
void merge(int a,int b){
a=find(a),b=find(b);
if(a==b) return;
if(rank1[a]>rank1[b]) swap(a,b);
par[a]=b;
rank1[b]+=rank1[a];
}
int n;
void initialize(int N) {
n=N;
REP(i,n) par[i]=i,rank1[i]=1;
}
int hasEdge(int a,int b) {
if(find(a)==find(b)){
return 1;
}
if(rank1[find(a)]+rank1[find(b)]!=n){
merge(a,b);
return 1;
}
return 0;
}
