#include "gap.h"
#include <bits/stdc++.h>
#define ll long long
long long findGap(int T, int N)
{
if(T==1){
std::vector<ll> left;
std::vector<ll> right;
ll v1=0-1,v2=1e18+1;
int k=1000;
while(k--)MinMax(1-1,1e18+1,&v1,&v2);
while(left.size()+right.size()<N){
MinMax(v1+1,v2-1,&v1,&v2);
left.push_back(v1);
right.push_back(v2);
}
ll best=0;
for(int i=0;i<left.size()-1;i++){
ll diff = std::abs(left[i+1]-left[i]);
best=std::max(diff,best);
}
for(int i=0;i<right.size()-1;i++){
ll diff = std::abs(right[i+1]-right[i]);
best=std::max(diff,best);
}
best=std::max(best,std::abs(right.back()-left.back()));
return best;
}
return 0;
}
