#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1600;
set<int> G[MAXN];
int visited = 0;
int nx;
void check(int v, int p){
visited++;
for(auto u: G[v]){
if(u == p) continue;
check(u, v);
}
}
int hasEdge(int u, int v){
auto it = G[v].find(u);
if(it == G[v].end())
return 0;
G[v].erase(it);
G[u].erase(v);
visited = 0;
if(visited == nx) return 0;
G[v].insert(u);
G[u].insert(v);
return 1;
}
void initg(int n){
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++)
if(i != j) G[i].insert(j);
}
void initialize(int n){
initg(n);
nx = n;
}
