#include <bits/stdc++.h>
#include "gap.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
const ll inf = 1e18;
vector <ll> a;
pair <ll, ll> ask (ll l, ll r) {
ll mn = l, mx = r;
MinMax(l, r, &mn, &mx);
return {mn, mx};
}
void recurse (ll l, ll r) {
if (l == r) {
a.push_back(l);
return;
}
ll mid = (l + r) / 2;
auto g = ask(l, mid);
if (g.first != -1) recurse(g.first, g.second);
g = ask(mid + 1, r);
if (g.first != -1) recurse(g.first, g.second);
}
ll findGap (int t, int n) {
ll ans = 0; a.clear();
auto g = ask(0, inf);
recurse(g.first, g.second);
for (int i = 0; i + 1 < n; i++) ans = max(ans, a[i + 1] - a[i]);
return ans;
}
