#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
long long findGap(int T, int N)
{
long long mn, mx;
long long left = 0, right = 1000000000000000000;
long long gap = 1;
MinMax(left, right, &mn, &mx);
left = mn + 1;
right = mx - 1;
int i = 1;
while(left <= right)
{
if(i == (N+1)/2)
{
gap = max(gap, mx - mn);
break;
}
long long newmn, newmx;
MinMax(left, right, &newmn, &newmx);
gap = max(max(gap, newmn - mn), mx - newmx);
left = newmn + 1;
right = newmx - 1;
mn = newmn;
mx = newmx;
i++;
}
return gap;
}
