#include "bits/stdc++.h"
#include "gap.h"
// #include "grader.cpp"
using namespace std;
#define ll long long
#define pb push_back
ll n, mn = 0, mx = 0, ans;
vector <ll> v;
ll answer;
void solve(ll l,ll r,ll mid) {
if(l > r) return;
if(l < mid) {
MinMax(l, mid, &mn, &mx);
if(mn != -1) {
v.pb(mn);
v.pb(mx);
solve(mn + 1, mx - 1, (mx + mn) / 2);
}
}
if(r >= mid + 1) {
MinMax(mid + 1, r, &mn, &mx);
if(mx != -1) {
v.pb(mn);
v.pb(mx);
solve(mn + 1, mx - 1, (mx + mn) / 2);
}
}
}
ll findGap(int T,int N) {
solve(0,1e18, 1e18 / 2);
sort(v.begin(),v.end());
ans = v[0];
for(auto i : v) {
answer = max(answer,i - ans);
ans = i;
}
return answer;
}
