#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef vector<int> vi;
typedef pair<int,int> pii;
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<" is "<<x<<endl;
#define debugl(x) cerr<<#x<<" is ";for(auto p:x)cerr<<p<<' ';cerr<<endl;
#define pb push_back
long long findGap(signed T, signed N) {
int a[N];
int a0,an;
MinMax(0,(int)1e18,&a0,&an);
a[0]=a0;
a[N-1]=an;
if(N%2){
for(int i=1;i<=N/2;i++){
MinMax(a[i-1]+1,a[N-i]-1,&a0,&an);
a[i]=a0;
a[N-i-1]=an;
}}
else{
for(int i=1;i<=N/2;i++){
MinMax(a[i-1]+1,a[N-i]-1,&a0,&an);
a[i]=a0;
a[N-i-1]=an;
}}
//debugl(a)
int ans=0;
for(int i=0;i<N-1;i++){
ans=max(ans,a[i+1]-a[i]);
}
return ans;
}
