#include <bits/stdc++.h>
#include "xylophone.h"
// #pragma GCC optimize ("Ofast,unroll-loops")
// #pragma GCC target ("avx2")
using namespace std;
typedef long long ll;
typedef pair<long double, ll> pp;
#define er(args ...) cerr << __LINE__ << ": ", err(new istringstream(string(#args)), args), cerr << endl
#define per(i,r,l) for(int i = (r); i >= (l); i--)
#define rep(i,l,r) for(int i = (l); i < (r); i++)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ss second
#define ff first
void err(istringstream *iss){}template<typename T,typename ...Args> void err(istringstream *iss,const T &_val, const Args&...args){string _name;*iss>>_name;if(_name.back()==',')_name.pop_back();cerr<<_name<<" = "<<_val<<", ",err(iss,args...);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll mod = 998244353, maxn = 5e5 + 5, lg = 10, inf = ll(1e9) + 5;
ll pw(ll a,ll b,ll md=mod){if(!b)return 1;ll k=pw(a,b>>1ll);return k*k%md*(b&1ll?a:1)%md;}
void solve(int n){
vector<int> d(n-1);
rep(i,0,n-1) d[i] = query(i+1, i+2);
vector<int> cr(n); cr[1] = d[0];
rep(i,2,n){
int t = query(i-1,i+1);
if(cr[i-2] < cr[i-1]){
if(t == cr[i-1]+d[i-1]-cr[i-2]) cr[i] = cr[i-1] + d[i-1];
else cr[i] = cr[i-1] - d[i-1];
}else{
if(t == cr[i-2]-(cr[i-1]-d[i-1])) cr[i] = cr[i-1] - d[i-1];
else cr[i] = cr[i-1] + d[i-1];
}
}
int p1 = min_element(all(cr)) - begin(cr), p2 = max_element(all(cr)) - begin(cr);
if(p1 > p2) rep(i,0,n) cr[i] = -cr[i];
int mn = *min_element(all(cr));
rep(i,0,n) cr[i] += 1 - mn, answer(i+1, cr[i]);
}
// int main(){
// cin.tie(0) -> sync_with_stdio(0);
// int n = sz(a);
// vector<int> d(n-1);
// rep(i,0,n-1) d[i] = query(i+1, i+2);
// vector<int> cr(n); cr[1] = d[0];
// rep(i,2,n){
// int t = query(i-1,i+1);
// if(cr[i-2] < cr[i-1]){
// if(t == cr[i-1]+d[i-1]-cr[i-2]) cr[i] = cr[i-1] + d[i-1];
// else cr[i] = cr[i-1] - d[i-1];
// }else{
// if(t == cr[i-2]-(cr[i-1]-d[i-1])) cr[i] = cr[i-1] - d[i-1];
// else cr[i] = cr[i-1] + d[i-1];
// }
// }
// int p1 = min_element(all(cr)) - begin(cr), p2 = max_element(all(cr)) - begin(cr);
// if(p1 > p2) rep(i,0,n) cr[i] = -cr[i];
// int mn = *min_element(all(cr));
// rep(i,0,n) cr[i] += 1 - mn;
// rep(i,0,n) cout << cr[i] << " \n"[i==n-1];
// return 0;
// }
