#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
long long findGap(int T, int N)
{
if(T == 1) {
vector<ll> a(N);
ll l = 0, r = 1e18;
int i = 0, j = N - 1;
while(i <= j) {
ll mn, mx;
MinMax(l, r, &mn, &mx);
a[i] = mn;
a[j] = mx;
l = mn + 1;
r = mx - 1;
++i;
--j;
}
ll ans = 0;
for(int i=0;i<N-1;++i)
ans = max(ans, a[i + 1] - a[i]);
return ans;
} else {
vector<ll> a;
ll mn, mx;
MinMax(0, 1e18, &mn, &mx);
ll l = mn, r = mx;
a.push_back(mn);
a.push_back(mx);
// ll gaps = (mx - mn + (N - 3) - 1) / (N - 2);
ll gaps = (mx - mn + N - 2) / (N - 1);
for(ll i=1;i<=N-2&&a.size()<N;++i) {
ll st = ((gaps * i) + l), en = min(r, (st + gaps - 1));
ll mn = -1, mx = -1;
int c = 0;
while((c == 0 || (c != 0 && mn != mx)) && st <= en && a.size() < N) {
MinMax(st, en, &mn, &mx);
if(mn != -1) {
a.push_back(mn);
st = mn + 1;
if(mn != mx) {
a.push_back(mx);
}
en = mx - 1;
}
++c;
}
}
sort(a.begin(), a.end());
cerr<<N<<'\n';
ll ans = 0;
for(int i=0;i<N-1;++i)
ans = max(ans, a[i + 1] - a[i]);
return ans;
}
}
