//Suleyman Atayew
#include "game.h"
#include <algorithm>
#include <iostream>
#include <string.h>
#include <stdio.h>
#include <vector>
#include <bitset>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#define N 1510
#define ff first
#define ss second
#define pb push_back
#define ll long long
#define mod 1000000007
#define pii pair <int, int>
#define sz(a) (int)(a.size())
ll bigmod(ll a, ll b) { if(b==0)return 1; ll ret = bigmod(a, b/2); return ret * ret % mod * (b%2 ? a : 1) % mod; }
using namespace std;
int arr[N], sz;
void initialize(int n) {
sz = n;
for(int i = 0; i < n; i++)
arr[i] = i;
}
int hasEdge(int u, int v) {
if(u > v) swap(u, v);
arr[v]--;
if(arr[v] == 0)
return 1;
return 0;
}
