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

using namespace std;

long long findGap(int T, int n) {
	if(T == 1) {
		vector<long long> a(n + 1);
		long long mn, mx, L = 0, R = 1e18;
		int l = 1, r = n;
		while(l <= r) {
			MinMax(L, R, &mn, &mx);
			a[l ++] = mn; if(l <= r) a[r --] = mx;
			L = mn + 1, R = mx - 1;
		}
		long long res = 0;
		for(int i = 2; i <= n; i ++) res = max(res, a[i] - a[i - 1]);
		return r;
	} else {
		return -1;
	}
}