//Make CSP great again
//Vengeance
#include <bits/stdc++.h>
#include "gap.h"
#define TASK "TESTCODE"
#define Log2(x) 31 - __builtin_clz(x)
using namespace std;
long long findGap(int t, int n)
{
long long res = 0;
long long mn, mx;
MinMax(0, 1e18, &mn, &mx);
long long maxPre = -1;
long long tmn, tmx;
tmn = mn;
tmx = mx;
for (long long l = tmn; l <= tmx; l += (tmx - tmn + 1)/n)
{
MinMax(l, l + (mx - mn + 1)/n - 1, &mn, &mx);
if (mn == -1)
{
continue;
}
if (maxPre != -1)
{
res = max(res, mn - maxPre);
}
maxPre = mx;
}
return res;
}
/*void read()
{
}
void solve()
{
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
if (fopen(TASK".INP", "r"))
{
freopen(TASK".INP", "r", stdin);
//freopen(TASK".OUT", "w", stdout);
}
int t = 1;
bool typetest = false;
if (typetest)
{
cin >> t;
}
for (int __ = 1; __ <= t; ++ __)
{
//cout << "Case " << __ << ": ";
read();
solve();
}
}*/
