#include "gap.h"
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int i;
ll n,mn,mx,lb,ub,x,rs,bl;
vector<pair<ll,ll> >vc;
ll findGap(int T,int N)
{
n=N;
MinMax(0,(1LL<<63),&lb,&ub);
bl=(ub-lb+1)/(n-1);
x=lb;
while(1)
{
MinMax(x,x+bl,&mn,&mx);
x+=bl+1;
if(mn!=-1)vc.pb(mkp(mn,mx));
if(mx==ub)break;
}
rs=bl;
for(i=1;i<(int)vc.size();i++)rs=max(rs,vc[i].fr-vc[i-1].sc);
return rs;
}
/*int main()
{
//freopen("sol.in","r",stdin);
//freopen("sol.out","w",stdout);
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
return 0;
}*/
