#include <bits/stdc++.h>
using namespace std;
#include "lokahia.h"
int FindBase(int N){
if (N == 1)
return 0;
srand(123);
int left = 300 - (N - 1);
vector<int> v(N, 1);
while (left) {
int hv = N;
int ta = rand() % hv;
for (int i = 0; i < N; i++) {
if (!v[i])
continue;
if (ta < v[i]) {
ta = i;
hv -= v[i];
break;
} else
ta -= v[i];
}
if (!hv)
break;
int tb = rand() % hv;
for (int i = 0; i < N; i++) {
if (!v[i] || i == ta)
continue;
if (tb < v[i]) {
tb = i;
hv -= v[i];
break;
} else
tb -= v[i];
}
int tc = CollectRelics(ta, tb);
if (tc != -1) {
if (tc != ta) {
v[tc] += v[ta];
v[ta] = 0;
}
if (tc != tb) {
v[tc] += v[tb];
v[tb] = 0;
}
}
left--;
}
int ans = -1, ma = -1;
for (int i = 0; i < N; i++)
if (v[i] >= ma) {
ma = v[i];
ans = i;
}
if (ans == -1)
return ans;
ma = 1;
for (int i = 0; i < N; i++)
if (i != ans)
ma += CollectRelics(i, ans) == ans;
if (ma > N / 2)
return ans;
return -1;
}
