#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
ll a[100100];
int n;
ll mx = 1;
void play(ll l, ll r) {
if (r - l <= mx) return;
ll mid = (l + r) / 2;
ll ql, qr, _l, _r;
MinMax(l + 1, mid, &_l, &ql);
MinMax(mid, r - 1, &qr, &_r);
if (ql == -1 && qr == -1) return;
if (ql == -1) {
mx = max(mx, r - _r);
return play(qr, _r);
}
if (qr == -1) {
mx = max(mx, _l - l);
return play(_l, ql);
}
if (ql != -1 && qr != -1) {
mx = max(mx, r - _r);
mx = max(mx, _l - l);
mx = max(mx, qr - ql);
play(_l, ql), play(qr, _r);
}
}
ll findGap(int T, int N) {
n = N;
if (T == 1) {
a[0] = -1, a[n + 1] = inf + 1;
for (int i = 1;i <= n / 2;i++) {
MinMax(a[i - 1] + 1, a[n - i + 2] - 1, &a[i], &a[n - i + 1]);
}
if (n & 1) {
ll _;
MinMax(a[n / 2] + 1, a[n / 2 + 2] - 1, &a[n / 2 + 1], &_);
}
for (int i = 1;i < n;i++) {
mx = max(mx, a[i + 1] - a[i]);
}
return mx;
}
ll l, r;
MinMax(0, inf, &l, &r);
play(l, r);
return mx;
}
