#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#include "gap.h"
//#define int long long
template <class F, class _S>
bool chmin(F &u, const _S &v){
bool flag = false;
if ( u > v ){
u = v; flag |= true;
}
return flag;
}
template <class F, class _S>
bool chmax(F &u, const _S &v){
bool flag = false;
if ( u < v ){
u = v; flag |= true;
}
return flag;
}
int solve1(int t, int n){
int ans = 1;
long long l = 0, r = 1e18;
vector<int> a, b;
while(l <= r){
long long lf = 1, rf = 1;
MinMax(l, r, &lf, &rf);
if(lf == -1)break;
a.pb(lf);
b.pb(rf);
l = lf+1;
r = rf-1;
}
sort(all(b));
for(int i = 1; i < (int)a.size(); i++)
chmax(ans, a[i] - a[i-1]);
for(int i = 1; i < (int)b.size(); i++)
chmax(ans, b[i] - b[i-1]);
return ans;
}
long long findGap(int t, int n)
{
//if(t == 1){
return solve1(t, n);
//}
return 0;
}
