#include "icc.h"
#define N 105
#include <bits/stdc++.h>
using namespace std;
set<int> grafo[N];
int pai[N], peso[N];
int Find(int x)
{
if(x == pai[x]) return x;
return pai[x] = Find(pai[x]);
}
void join(int a, int b)
{
a = Find(a), b = Find(b);
if(a == b) return;
if(peso[a] > peso[b]) pai[b] = a;
else if(peso[a] < peso[b]) pai[a] = b;
else pai[a] = b, peso[b] ++;
}
void run(int n)
{
for(int i = 1; i <= n; i++)
{
pai[i] = i;
}
for(int i = 1; i < n; i++)
{
vector<int> ok;
for(int a = 1; a <= n; a++)
{
int esq[N], dir[N], id = 0;
esq[0] = a;
for(int b = 1; b <= n; b++)
{
if(Find(a) != Find(b))
{
dir[id] = b;
id ++;
}
}
if(query(1, id, esq, dir) > 0)
{
ok.push_back(a);
}
}
join(ok[0], ok[1]);
//cout<<i<<" "<<ok.size()<<" "<<" ROAD "<<ok[0]<<" "<<ok[1]<<"\n";
setRoad(ok[0], ok[1]);
}
}
