#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define fr first
#define sc second
#define endl '\n'
using namespace std;
#define mid ((left+right)>>1)
#include "park.h"
mt19937 rng(chrono::high_resolution_clock().now().time_since_epoch().count());
int rint(int a,int b){
int ans=0;
ans=a+(rng()%(b-a+1));
return ans;
}
int n;
static int arr[1400];
vector<int>source;
vector<int>komsu[1400];
int var[1400],dep[1400];
int par[1400];
int in[1400],out[1400];
set<pair<int,int>>soruldu;
void answer(int x,int y,bool ekle=true){
if(x>y)swap(x,y);
if(soruldu.count({x,y}))return;
soruldu.insert({x,y});
if(ekle)komsu[x].pb(y);
if(ekle)komsu[y].pb(x);
Answer(x,y);
}
bool ask(int x,int y){
if(x>y)swap(x,y);
if(x==y)return true;
return Ask(x,y,arr);
}
void spread_love(){
for(int x:source){
dep[x]=0;
}
source.clear();
queue<int>q;
dep[0]=1;
q.push(0);
while(q.size()){
int pos=q.front();
source.pb(pos);
q.pop();
for(int x:komsu[pos]){
if(dep[x])continue;
dep[x]=dep[pos]+1;
q.push(x);
}
}
}
void if_you_are_in_source_raise_your_hand(int x=-1){
if(x==-1)x=source.size()-1;
for(int i=0;i<=x;i++){
arr[source[i]]=1;
}
}
void kill_all(){
for(int i=0;i<n;i++){
arr[i]=0;
}
}
void f(int pos){
kill_all();
if_you_are_in_source_raise_your_hand();
arr[pos]=1;
if(ask(0,pos)){
spread_love();
int l=0,r=source.size()-1;
while(l<r){
int mi=(l+r)/2;
kill_all();
if_you_are_in_source_raise_your_hand(mi);
arr[pos]=1;
if(ask(0,pos))r=mi;
else l=mi+1;
}
answer(pos,source[l]);
var[pos]=1;
source.pb(pos);
return;
}
while(true){
vector<int>v;
for(int i=0;i<n;i++){
if(var[i])continue;
if(i==pos)continue;
v.pb(i);
}
int l=0,r=v.size()-1;
while(l<r){
int mi=(l+r)/2;
kill_all();
if_you_are_in_source_raise_your_hand();
arr[pos]=1;
for(int i=0;i<=mi;i++){
arr[v[i]]=1;
}
if(ask(0,pos))r=mi;
else l=mi+1;
}
f(v[l]);
kill_all();
arr[pos]=arr[v[l]]=1;
if(ask(pos,v[l])){
answer(pos,v[l]);
var[pos]=1;
source.pb(pos);
break;
}
}
}
int t=0;
void dfs(int pos){
in[pos]=++t;
for(int x:komsu[pos]){
if(x==par[pos])continue;
par[x]=pos;
dep[x]=dep[pos]+1;
dfs(x);
}
out[pos]=t;
}
void ara(vector<int>v,int root){
if(!v.size())return;
kill_all();
for(int x:v){
arr[x]=1;
}
for(int x:komsu[root]){
arr[x]=0;
}
arr[root]=1;
if(!ask(root,v[0]))return;
sort(v.begin(),v.end(),[&](const int &x,const int &y){
return in[x]<in[y];
});
int l=0,r=v.size();
while(l<r){
int mi=(l+r)/2;
kill_all();
for(int i=0;i<=mi;i++){
arr[v[i]]=1;
}
for(int x:komsu[root]){
arr[x]=0;
}
arr[root]=1;
if(ask(root,v[0]))r=mi;
else l=mi+1;
}
l=v[l];
answer(root,l,false);
for(int x:komsu[l]){
vector<int>v2;
for(int j:v){
if(x==par[l]){
if(!(in[l]<=in[j]&&out[l]>=in[j])){
v2.pb(j);
}
}
else{
if(in[x]<=in[j]&&out[x]>=in[j]){
v2.pb(j);
}
}
}
ara(v2,root);
}
}
void Detect(int T, int N) {
n=N;
source={0};
var[0]=1;
for(int i=1;i<n;i++){
if(var[i])continue;
f(i);
}
par[0]=0;
dep[0]=1;
dfs(0);
for(int i=1;i<n;i++){
for(int x:komsu[par[i]]){
if(x==i)continue;
vector<int>v;
for(int j=0;j<n;j++){
if(x==par[par[i]]){
if(!(in[par[i]]<=in[j]&&out[par[i]]>=in[j])){
v.pb(j);
}
}
else{
if(in[x]<=in[j]&&out[x]>=in[j]){
v.pb(j);
}
}
}
ara(v,i);
}
}
}
