/*input
*/
#include <bits/stdc++.h>
#include "meetings.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;
#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"
const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;
template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }
template<typename T>
void print(vector<T> vec, string name = "") {
cout << name;
for (auto u : vec)
cout << u << ' ';
cout << '\n';
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void bridge(int a, int b) {
if (a > b) swap(a, b);
Bridge(a, b);
}
void solve(vi aibe) {
if (aibe.size() <= 1) return;
int root = aibe[rng() % ((int)aibe.size())];
int nxt;
do {
nxt = aibe[rng() % ((int)aibe.size())];
} while (nxt == root);
vi path = {nxt};
vi vaikai[2100];
for (auto u : aibe) {
if (u == root or u == nxt) continue;
int ans = Query(root, nxt, u);
if (ans == u) path.push_back(u);
else vaikai[ans].push_back(u);
}
sort(path.begin(), path.end(), [&](int a, int b) {
return Query(root, a, b) == a;
});
bridge(root, path[0]);
for (int i = 1; i < path.size(); ++i)
bridge(path[i - 1], path[i]);
for (auto u : path) {
vaikai[u].push_back(u);
solve(vaikai[u]);
}
vaikai[root].push_back(root);
solve(vaikai[root]);
}
void Solve(int N) {
vi temp;
for (int i = 0; i < N; ++i)
temp.emplace_back(i);
solve(temp);
}
