#include "gap.h"
long long findGap (int subTask, int n) {
long long l, r;
MinMax(0, 1e18, &l, &r);
long long block = (r - l - 1 + n - 2)/(n - 1);
// cout << l << " " << r << " " << block << endl;
long long ret = 0, last = l;
for (long long i = l + 1, j = l + 1 + block; i < r; i += block, j += block) {
long long x, y;
if (j > r) j = r;
MinMax(i, j - 1, &x, &y);
// cout << x << " " << y << endl;
if (x != -1) {
if (x - last > ret) {
ret = x - last;
}
last = y;
}
}
if (ret == 0) ret = r - l;
return ret;
}
