#include <iostream>
#include <cstdio>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <cmath>
#include <climits>
#include <iomanip>
#include <limits>
#include <tuple>
#include <stack>
#include <bitset>
#include <cstring>
#include <sstream>
#include <functional>
#include <random>
#include "gap.h"
using namespace std;
using ll = long long;
ll findGap(int T, int N) {
vector<ll> a(N);
ll mn = -1, mx = 1000000000000000000LL + 1;
for (int i = 0; i < N / 2; ++i) {
MinMax(mn + 1, mx - 1, &mn, &mx);
a[i] = mn, a[N - i - 1] = mx;
}
if (N % 2 == 1) {
MinMax(mn + 1, mx - 1, &mn, &mx);
a[N / 2] = mn;
}
ll ans = -1;
for (int i = 0; i < N - 1; ++i) {
ans = max(ans, a[i + 1] - a[i]);
}
return ans;
}
