#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 ll INF = (ll)1e18;
const int MAXN = (int)1e5 + 5;
ll a[MAXN];
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;
while (r - l - 1 >= 2) {
MinMax(mn + 1, mx - 1, &mn, &mx);
a[++l] = mn;
a[--r] = mx;
}
if (r - l + 1 == 3) {
MinMax(mn + 1, mx - 1, &mn, &mx);
a[l + 1] = mn;
}
ll ans = 0;
for (int i = 1; i < n; i++) {
ans = max(ans, a[i + 1] - a[i]);
}
return ans;
}
