#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lsb(x) (x&(-x))
#define pii pair<int,int>
#define ss second
#define ff first
#define piii pair<int,pii>
#define debu(x) (cerr << #x << " = "<< x << "\n")
#define debu2(x,y) (cerr << #x << " = "<< x << " " << #y << " = " << y << "\n")
#define debu3(x,y,z) (cerr << #x << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n")
#define bitout(x,y) {\
cerr << #x << " : ";\
for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
cout << "\n";\
}
#define rangeout(j,rangestart,rangeend) {\
cerr << "outputting " << #j<< ":\n";\
for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\
cerr<<"\n";\
}
#define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();}
#define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();}
#define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();}
#define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();}
#define vi vector<int>
#define vpii vector<pii>
#define fr(i,x,y) for(int i=x;i<=y;i++)
#define pf push_front;
long long findGap(int T, int N)
{
#define int long long
vi nums;int t1,t2;
int fr=-1,ba=1000000000000000001;
while(nums.size()<N)
{
//debu2(fr+1,ba-1);
MinMax(fr+1,ba-1,&t1,&t2);//c2;
//debu2(t1,t2);cerr.flush();
nums.pb(t1);nums.pb(t2);
fr=t1;ba=t2;
}
sort(nums.begin(),nums.end());
int ans=0;
for(int i=1;i<nums.size();i++)
{
ans=max(nums[i]-nums[i-1],ans);
}
return ans;
#undef int
}
