#include "park.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::high_resolution_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
struct pair_hash{
size_t operator()(const pair<int,int>&x)const{
return hash<long long>()(((long long)x.first)^(((long long)x.second)<<32));
}
};
const int MAXN = 1505;
vi g[MAXN];
int vis[MAXN];
int vis2[MAXN];
int f[MAXN];
bool blocked[MAXN];
static int p[MAXN];
vi curr;
vector<pii> edges;
int n;
bool neighbour(int a, int b){
if(a == b){
return false;
}
for(int i = 0; i < n; i++){
p[i] = 0;
}
p[a] = p[b] = 1;
if(a > b){
swap(a, b);
}
return Ask(a, b, p);
}
void dfs(int v, int a, int b){
vis[v] = 1;
for(auto u : g[v]){
if(vis[u]){
continue;
}
dfs(u, a, b);
}
if(v != a && v != b){
curr.pb(v);
}
}
bool check(int a, int b, vi vec){
if(a == b){
return true;
}
for(int i = 0; i < n; i++){
p[i] = 1;
}
p[a] = p[b] = 1;
for(auto ele : vec){
p[ele] = 0;
}
if(a > b){
swap(a, b);
}
return Ask(a, b, p);
}
void merge(int a, int b){
if(f[b] || a == b){
return;
}
if(neighbour(a, b)){
f[b] = 1;
g[a].pb(b);
g[b].pb(a);
return;
}
curr.clear();
for(int i = 0; i < n; i++){
vis[i] = 0;
}
dfs(0, a, b);
for(int i = 0; i < n; i++){
if(i == a || i == b){
continue;
}
if(!vis[i]){
curr.pb(i);
}
}
int mid;
while(sz(curr) > 1){
mid = sz(curr) / 2;
vi l = {}, p = {};
for(int i = 0; i < mid; i++){
l.pb(curr[i]);
}
for(int i = mid; i < sz(curr); i++){
p.pb(curr[i]);
}
if(check(a, b, l)){
curr = p;
}else{
curr = l;
}
}
mid = curr[0];
merge(a, mid);
merge(mid, b);
}
vi curr2;
void dfs3(int v, int a, int b){
vis[v] = 1;
for(auto u : g[v]){
if(!vis[u] && !blocked[u]){
dfs3(u, a, b);
}
}
if(v != b && v != a){
curr2.pb(v);
}
}
bool check2(int a, int b){
if(a == b){
return true;
}
for(int i = 0; i < n; i++){
p[i] = 0;
}
p[a] = p[b] = 1;
for(auto ele : curr2){
p[ele] = 1;
}
if(a > b){
swap(a, b);
}
return Ask(a, b, p);
}
bool check3(int a, int b, int k){
if(a == b){
return true;
}
for(int i = 0; i < n; i++){
p[i] = 0;
}
p[a] = p[b] = 1;
for(int i = k; i < sz(curr2); i++){
p[curr2[i]] = 1;
}
if(a > b){
swap(a, b);
}
return Ask(a, b, p);
}
void addEdges(int v, int x){
if(blocked[v]){
return;
}
curr2.clear();
for(int i = 0; i < n; i++){
vis[i] = false;
}
if(neighbour(v, x)){
g[v].pb(x);
g[x].pb(v);
}
dfs3(v, v, x);
blocked[v] = 1;
if(check2(v, x)){
int l = 0;
int p = sz(curr2) - 1;
int mid;
while(l < p){
mid = (l + p + 1) / 2;
if(check3(v, x, mid)){
l = mid;
}else{
p = mid - 1;
}
}
int split = curr2[mid];
for(auto u : g[split]){
if(!blocked[u]){
addEdges(u, x);
}
}
}
}
void dfs2(int v, int p){
//dodaj krawędzie niedrzewowe
vis2[v] = 1;
for(int i = 0; i < n; i++){
vis[i] = false;
blocked[i] = false;
}
vi ncurr = {};
for(auto ele : curr){
if(ele != p){
ncurr.pb(ele);
}
}
curr = ncurr;
if(sz(curr)){
addEdges(curr[0], v);
}
curr.pb(p);
curr.pb(v);
for(auto u : g[v]){
if(!vis2[u] && u != p){
dfs2(u, v);
}
}
}
void Detect(int T, int N){
for(int i = 0; i < MAXN; i++){
p[i] = 0;
}
n = N;
if(T == 1){
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
if(neighbour(i, j)){
Answer(i, j);
}
}
}
return;
}
for(int i = 1; i < n; i++){
merge(0, i);
}
curr.clear();
for(int i = 0; i < n; i++){
vis[i] = 0;
}
dfs2(0, 0);
for(int i = 0; i < n; i++){
for(auto u : g[i]){
if(i < u){
Answer(i, u);
}
}
}
}
