#include "xylophone.h"
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
//static int A[5000];
ll i,du[5050],ti[5050],d[5050],a[5050],I,J,mi;
void solve(int N) {
for(i=1;i<N;i++)du[i]=query(i,i+1);
for(i=1;i<(N-1);i++)ti[i]=query(i,i+2);
d[2]=du[1];
for(i=3;i<=N;i++)
{
if(ti[i-2]==(du[i-2]+du[i-1]))
{
//cout<<"A"<<"\n";
if(d[i-1]>0)d[i]=du[i-1];
if(d[i-1]<0)d[i]=-du[i-1];
}
else
{
if(d[i-1]>0)d[i]=-du[i-1];
if(d[i-1]<0)d[i]=du[i-1];
}
}
mi=1e18;
for(i=1;i<=N;i++)a[i]=a[i-1]+d[i];
for(i=1;i<=N;i++)mi=min(mi,a[i]);
for(i=1;i<=N;i++)a[i]-=(mi-1);
for(i=1;i<=N;i++)if(a[i]==1)I=i;
for(i=1;i<=N;i++)if(a[i]==N)J=i;
if(I>J)
{
d[2]=-du[1];
for(i=3;i<=N;i++)
{
if(ti[i-2]==(du[i-2]+du[i-1]))
{
if(d[i-1]>0)d[i]=du[i-1];
if(d[i-1]<0)d[i]=-du[i-1];
}
else
{
if(d[i-1]>0)d[i]=-du[i-1];
if(d[i-1]<0)d[i]=du[i-1];
}
}
mi=1e18;
for(i=1;i<=N;i++)a[i]=a[i-1]+d[i];
for(i=1;i<=N;i++)mi=min(mi,a[i]);
for(i=1;i<=N;i++)a[i]-=(mi-1);
}
for(i=1;i<=N;i++)answer(i,a[i]);
//for(i=1;i<=N;i++)cout<<i<<" "<<a[i]<<"\n";
}
