# include <iostream>
# include <vector>
# include <algorithm>
using namespace std;
# include "gap.h"
//# include "grader.cpp"
long long findGap(int T, int _N)
{
long long n=_N;
long long curr,to;
MinMax(0,1e18,&curr,&to);
long long S=(to-curr+n-2)/(n-1),ans=S;
vector<long long> v;
while(curr<=to)
{
long long r=min(curr+S,to),mn,mx;
MinMax(curr,r,&mn,&mx);
if(mn!=-1) {v.push_back(mn);v.push_back(mx);}
curr=r+1;
}
//cout<<S<<":"<<"\n";
//for(long long x: v) cout<<x<<" ";
//cout<<"\n";
int sz=v.size();
for(int i=0;i+1<sz;i++) ans=max(ans,v[i+1]-v[i]);
return ans;
}
/*
2 4
2 3 6 8
*/
/*
2 4
1 10000 1000000 200000000 2000000000000
*/
