#include <bits/stdc++.h>
using namespace std;
long long arr[100005];
void MinMax(long long s, long long t,
long long* mn, long long* mx);
long long findGap(int T, int N){
if (T == 1){
int ind_st = 0;
int ind_en = N-1;
long long num_st = 0;
long long num_en = 1000000000000000000;
long long num_st1 = 0;
long long num_en1 = 1000000000000000000;
for(int x = 0; x < N/2; x++){
MinMax(num_st,num_en,&num_st1,&num_en1);
num_st = num_st1+1;
num_en = num_en1-1;
arr[ind_st] = num_st1;
arr[ind_en] = num_en1;
ind_st += 1;
ind_en -= 1;
}
if (N % 2 == 1){
MinMax(num_st,num_en,&num_st1,&num_en1);
arr[ind_st] = num_st1;
}
long long kq = 0;
for(int x = 0; x < N-1; ++x){
kq = (1ll)*max(kq,arr[x+1]-arr[x]);
}
return kq;
}
else{
return -1;
}
}
