#include "gap.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

long long findGap(int T, int N) {
	if (T == 1) {
		ll lf = -1, rg = 1e18 + 1, bs = 0;
		for (int j = 0; j < (N + 1) / 2; j++) {
			ll mn, mx;
			ll *uk_mn{&mn}, *uk_mx{&mx};
			MinMax(lf + 1, rg - 1, uk_mn, uk_mx);
			if (lf != -1) bs = max(bs, lf - mn);
			if (rg != 1e18 + 1) bs = max(bs, rg - mx);
			bs = max(bs, mx - mn);
			lf = mn; rg = mx;
		} 
		return bs;
	}
	return 0;
}