#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int mxN = 1e5 + 5;
ll n,a[mxN];
long long findGap(int T, int N){
n = N;
if(T == 1 or n <= 8){
ll l = 0,r = 1e18,mn,mx;
for(int i = 0; i < (n + 1) / 2; i++){
MinMax(l, r, &mn, &mx);
a[i] = mn;
a[n - i - 1] = mx;
l = mn + 1;
r = mx - 1;
}
ll ans = 0;
for(int i = 0; i < n - 1; i++) ans = max(ans, a[i + 1] - a[i]);
return ans;
}
ll l,r,l1,r1;
MinMax(0, 1e18, &l, &r);
ll dis = (r - l + n - 2) / (n - 1),ans = 1;
for(ll i = l + 1; i <= r; i += dis){
cout << i << endl;
MinMax(i, i + dis - 1, &l1, &r1);
if(l1 == -1) continue;
ans = max(ans, l1 - l);
l = r1;
}
return ans;
}
