#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#include "grader.cpp"
#endif
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
Tran The Bao
CTL - Da Lat
Cay ngay cay dem nhung deo duoc cong nhan
*/
const int NMAX = 1e5 + 1;
int n;
ll a[NMAX];
ll findGap(int T, int N) {
::n = N;
if (T == 1) {
ll l = 0, r = 1e18;
int pl = 1, pr = n;
WHILE(pl <= pr) {
MinMax(l, r, &l, &r);
a[pl] = l;
a[pr] = r;
++l;
--r;
++pl;
--pr;
}
ll rs = 0;
FOR(i, 1, n - 1) rs = max(rs, a[i + 1] - a[i]);
return rs;
}
ll l = 0, r = 1e18;
MinMax(l, r, &l, &r);
ll Min = (r - l + n - 2) / (n - 1);
assert((r - l + 1) / (Min + 1) <= n);
ll pre = -1;
ll rs = Min;
for (; l <= r;) {
ll nl = l;
ll nr = min(l + Min, r);
MinMax(nl, nr, &nl, &nr);
if (nl != -1 && pre != -1) rs = max(rs, nl - pre);
if (nr != -1) pre = nr;
l += Min + 1;
}
return rs;
}
