#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include "xylophone.h"
using namespace std;
#define ll long long
#define f first
#define s second
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
template<typename A> void __print(const A &x) {
bool first = true;
cerr << '{';
for (const auto &i : x) {
cerr << (first ? "" : ","), __print(i);
first = false;
}
cerr << '}';
}
template<typename A, typename B> void __print(const pair<A, B> &p) {
cerr << '(';
__print(p.f);
cerr << ',';
__print(p.s);
cerr << ')';
}
template<typename... A> void __print(const tuple<A...> &t) {
bool first = true;
cerr << '(';
apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
cerr << ')';
}
template<typename T> void __print(stack<T> s) {
vector<T> debugVector;
while (!s.empty()) {
T t = s.top();
debugVector.push_back(t);
s.pop();
}
reverse(debugVector.begin(), debugVector.end());
__print(debugVector);
}
template<typename T> void __print(queue<T> q) {
vector<T> debugVector;
while (!q.empty()) {
T t = q.front();
debugVector.push_back(t);
q.pop();
}
__print(debugVector);
}
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
vector<T> debugVector;
while (!q.empty()) {
T t = q.top();
debugVector.push_back(t);
q.pop();
}
__print(debugVector);
}
void _print() { cerr << "]\n"; }
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
__print(H);
if (sizeof...(T)) cerr << ", ";
_print(T...);
}
#ifdef DEBUG
#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
#define D(...)
#endif
void solve(int n) {
vector<int> adj, tri;
for (int i = 1; i < n; i++) {
adj.push_back(query(i, i + 1));
}
D(adj);
for (int i = 1; i < n - 1; i++) {
tri.push_back(query(i, i + 2));
}
D(tri);
vector<int> v;
v.push_back(0);
v.push_back(adj[0]);
for (int i = 0; i < tri.size(); i++) {
if (tri[i] == adj[i] + adj[i + 1]) {
v.push_back(v.back() / adj[i] * adj[i + 1]);
} else {
v.push_back(-v.back() / adj[i] * adj[i + 1]);
}
}
D(v);
int mn = 2e9, mx = 0, pref = 0, mnpos = 0, mxpos = 0;
for (int i = 0; i < v.size(); i++) {
pref += v[i];
if (pref > mx) {
mx = pref;
mxpos = i;
}
if (pref < mn) {
mn = pref;
mnpos = i;
}
}
D(mx);
D(mn);
if (mx + abs(mn) + 1 > n || mnpos >= mxpos) {
for (int i = 0; i < v.size(); i++) {
v[i] *= -1;
}
}
D(v);
mn = 0;
for (int i = 1; i < v.size(); i++) {
v[i] += v[i - 1];
mn = min(v[i], mn);
}
for (int i = 0; i < v.size(); i++) {
answer(i + 1, v[i] + abs(mn) + 1);
}
return;
}
