#include "gap.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
//MinMax(long long s, long long t, long long *mn, long long *mx)
const int INF = (int)1e18;
const int MAXN = (int)1e5 + 5;
ll a[MAXN];
void f(bool ok) {
if (!ok) {
while (1);
}
}
long long findGap(int type, int n)
{
ll mn, mx;
MinMax(0, INF, &mn, &mx);
int l = 1, r = n;
a[l] = mn;
a[r] = mx;
l++, r--;
while (l <= r) {
if (l != r) {
f(mn + 1 <= mx - 1);
MinMax(mn + 1, mx - 1, &mn, &mx);
a[l] = mn;
a[r] = mx;
} else {
f(mn + 1 <= mx - 1);
MinMax(mn + 1, mx - 1, &mn, &mx);
a[l] = mn;
}
l++, r--;
}
ll ans = 0;
for (int i = 1; i < n; i++) {
ans = max(ans, a[i + 1] - a[i]);
}
return ans;
}
