#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define fi first
#define se second
#define endl '\n'
template <typename T>
using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
int n;
vector<int> fre;
void initialize(int N){
fre.resize(N);
}
bool hasEdge(int u, int v){
fre[max(u, v)]++;
return fre[max(u, v)] == max(u, v);
}
/*
*/
