#include <iostream>
using namespace std;
int n, p[1501], sz[1501];
bool chk[1501][1501];
int findSet(int i){return i==p[i]?i:p[i]=findSet(p[i]);}
void unionSet(int i, int j){
int x = findSet(i), y = findSet(j);
if(x==y) return;
if(sz[x]<sz[y]) swap(x,y);
p[y] = x; sz[x]+=sz[y];
}
void initialize(int N){
n = N; for(int i =0; i < N; i++) p[i]=i,sz[i]=1;
}
int hasEdge(int u, int v){
int cnt = 0;
for(int i = 0; i < n and cnt<2; i++)
if(findSet(i)==u)
for(int j = 0; j < n and cnt<2; j++)
if(findSet(j)==v and !chk[i][j]) cnt++;
if(cnt==1) unionSet(u,v);
chk[u][v]=chk[v][u]=1;
return cnt==1;
}
