/*
Author : detective conan
Problem : JOI18_Xylophone
Created : 17/03/2025 13:42 UTC+7
*/
#include <bits/stdc++.h>
#define FOR(i, s, t) for(int i = s; i <= t; ++i)
#define rep(i, s, t) for(int i = s; i >= t; --i)
#define DB(n, s) cout << n << s
#define ANS(n, s) DB(n, s)
#define mod 1e9 + 7
#define HAVE_TESTCASE false
#define conan cin.tie(nullptr)->sync_with_stdio(false)
#define sum(a, b) ((a%mod) + (b%mod))%mod
#define mul(a, b) ((a%mod) * (b%mod))
#define pb push_back
#define eb emplace_back
#define em emplace
using namespace std;
using u32 = unsigned;
using i64 = int64_t;
using u64 = unsigned i64;
using namespace std;
#include "xylophone.h"
/*
static int A[5000];
static const int N_MAX = 5000;
static const int Q_MAX = 10000;
static int N;
static int A[N_MAX];
static bool used[N_MAX];
static int query_c;
static int answer_c;
int query(int s, int t) {
if(query_c >= Q_MAX) {
printf("Wrong Answer\n");
exit(0);
}
query_c++;
if(!(1 <= s && s <= t && t <= N)) {
printf("Wrong Answer\n");
exit(0);
}
int mx = 0, mn = N + 1;
for(int i = s - 1; i < t; i++) {
if(mx < A[i]) {
mx = A[i];
}
if(mn > A[i]) {
mn = A[i];
}
}
return mx - mn;
}
void answer(int i, int a) {
answer_c++;
if(!(1 <= i && i <= N)) {
printf("Wrong Answer\n");
exit(0);
}
if(!(1 <= a && a <= N)) {
printf("Wrong Answer\n");
exit(0);
}
if(used[i - 1]) {
printf("Wrong Answer\n");
exit(0);
}
if(a != A[i - 1]) {
printf("Wrong Answer\n");
exit(0);
}
used[i - 1] = true;
}*/
void solve(int N) {
int ans[N + 1] = {0}, dif[N + 1] = {0}, mnp = 1, mxp = 1, mn = N + 1, mx = 0;
ans[1] = 0, ans[2] = query(1, 2), dif[2] = ans[2];
FOR(i, 3, N){
int s = query(i - 2, i);
int t = query(i - 1, i);
dif[i] = t;
if(s == dif[i]){
if(ans[i - 2] >= ans[i - 1]) ans[i] = ans[i - 1] + t;
else ans[i] = ans[i - 1] - t;
}
else if(dif[i-1] + t == s) {
if(ans[i - 2] >= ans[i - 1]) ans[i] = ans[i - 1] - t;
else ans[i] = ans[i - 1] + t;
}
else {
if(ans[i - 2] >= ans[i - 1]) ans[i] = ans[i - 1] - t;
else ans[i] = ans[i - 1] + t;
}
if(ans[i] < mn) mn = ans[i], mnp = i;
if(ans[i] > mx) mx = ans[i], mxp = i;
}
FOR(i, 1, N) ans[i] += 1 - mn;
if(mnp > mxp) {
FOR(i, 1, N) ans[i] = N - ans[i] + 1;
}
FOR(i, 1, N) answer(i, ans[i]);
}
/*
int main() {
query_c = 0;
answer_c = 0;
if(scanf("%d", &N) != 1) {
fprintf(stderr, "Error while reading input\n");
exit(1);
}
for(int i = 0; i < N; i++) {
if(scanf("%d", A + i) != 1) {
fprintf(stderr, "Error while reading input\n");
exit(1);
}
used[i] = false;
}
solve(N);
if(!(answer_c == N)) {
printf("Wrong Answer\n");
exit(0);
}
printf("Accepted : %d\n", query_c);
}
*/
