#include "game.h"
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
int N;
vector<set<int>> arr;
vvi paths;
int found = 0;
void initialize(int n) {
N = n;
arr = vector<set<int>>(1502);
paths = vvi(1502,vi());
FOR(i,0,N){
FOR(j,0,N){
if(i == j)continue;
arr[i].insert(j);
}
}
}
void dfs(int pos,int prev,int end){
if(pos == end){
found = 1;
return;
}
for(int a:paths[pos]){
if(a == prev)continue;
dfs(a,pos,end);
}
}
int hasEdge(int u, int v) {
if(u==v)return 1;
arr[u].erase(v);
arr[v].erase(u);
found = 0;
dfs(u,-1,v);
if(found)return 1;
if(arr[u].size() == 0 || arr[v].size() == 0){
paths[u].pb(v);
paths[v].pb(u);
return 1;
}
return 0;
}
