#include "gap.h"
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l,int r)
{
return uniform_int_distribution<int>(l,r)(rd);
}
void phongbeo();
const int inf = 1e16;
const ll mod2 = 1e9+7;
const ll base=67;
ll n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
ll i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
ll kk;
ll t;
ll el = 19;/*
main()
{
if(fopen(task2".inp","r"))
{
fin(task2);
fou(task2);
}
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
/// cin>>s1;
//int t;cin>>t; while(t--)
phongbeo();
// checktime
}
map<int,int>c;
set<int> s;
int a[100001];
map<int,int> d;
void MinMax(int l,int r,int& mn,int& mx)
{
auto x=s.lower_bound(l);
if(x==s.end()||*x>r)
{ m++;
mn=-1,mx=-1;
return;
}
mn=*x;
x=s.upper_bound(r);
x=prev(x);
mx=*x;
m=m+d[mx]-d[mn]+1;
}*/
ll findGap(int t,int n)
{
if(t==1)
{
l=0;
r=1e18;
vector<ll> v;
while(l<r&&v.size()<n)
{
MinMax(l,r,&l,&r);
v.pb(l);
if(l!=r)
v.pb(r);
l++;
r--;
}
sort(v.begin(),v.end());
for(int i=0;i<v.size()-1;i++)
s7=max(v[i+1]-v[i],s7);
return s7;
}
else
{ MinMax(0,1e18,&l,&r);
ll sz=(r-l)/(n-1)+((r-l)%(n-1)!=0);
s7=0;
ll last=l;
l++;
s7=sz;
for(l; l<r; l+=s7+1)
{
MinMax(l,min(l+s7,r-1),&s5,&s6);
if(s5==-1) continue;
s7=max(s7,s5-last);
last=s6;
l=s6+1-(s7+1);
}
s7=max(s7,r-last);
return s7;
}
}/*
void phongbeo()
{
cin>>n;
/*for(int i=1;i<=n;i++)
{
cin>>a[i];
c[a[i]]=1;
s.insert(a[i]);
}
for(int i=1; i<=n; i++)
{
int x=rand(1,1e18);
while(c[x])
x=rand(1,1e18);
c[x]=1;
a[i]=x;
s.insert(x);
}
sort(a+1,a+1+n);
s4=0;
for(int i=1;i<=n;i++)
d[a[i]]=i;
for(int i=1; i<n; i++){
if(a[i+1]-a[i]==374219061325381864)
cout<<a[i],down
s4=max(a[i+1]-a[i],s4);}
s2=findGap(2,n);
for(int i=1;i<=n;i++)
cout<<a[i]<<" ";
down
cout<<s2<<" "<<s4,down
assert(s2==s4);
}
*/
