#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 100005
#include "gap.h"
typedef long long ll;
using namespace std;
ll findGap(int t,int n){
if(t==1){ll res=0;
ll l,d,tl,td;
MinMax(0ll,1000000000000000000ll,&l,&d);
while(n>2){
MinMax(l+1,d-1,&tl,&td);
//printf(" %lld %lld %lld %lld\n",l,d,tl,td);
res=max(res,max(tl-l,d-td));
l=tl;
d=td;
n-=2;
}
if(n==2)res=max(res,d-l);
return res;
}
ll l,d,res=0;
MinMax(0ll,1000000000000000000ll,&l,&d);
ll korak=(d-l)/(n-1);
ll tl=l+1,kolko,a,b;
ll prosli=l;
while(tl<=d){
MinMax(tl,tl+korak, &a, &b);
if(a==-1){
tl+=korak+1;
}else{
res=max(res,a-prosli);
prosli=b;
tl+=korak+1;
}
}
return res;
}
