#include<meetings.h>
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define eb emplace_back
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int N = 2e3 + 5, MAXN = 1e7 + 5;
const long long oo = 1e9 + 7, mod = 1e9 + 7;
vector<int> vis[N];
int sz[N];
void Solve(int n){
for(int i = 1; i < n; i++){
for(int j = i + 1; j < n; j++){
int temp = Query(0, i, j);
if(temp == i){
//se[j].insert(i);
sz[j]++;
vis[i].pb(j);
}
}
}
queue<int> que;
que.push(0);
while(!que.empty()){
int u = que.front();
que.pop();
for(auto it : vis[u]){
sz[it]--;
if(!sz[it]){
Bridge(min(u, it), max(u, it));
que.push(it);
}
}
}
}
