#include "xylophone.h"
#include<bits/stdc++.h>
//#define int   long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP     ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe  int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task2 "ftree"
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define mask(k) (1<<k)
#define mp make_pair
#define checktime   cerr << (double)clock() / CLOCKS_PER_SEC * 1000  << " ms";
using namespace std;
#define getchar_unlocked getchar

inline int scan()
{
    char c = getchar_unlocked();
    int x = 0;
    while (c < '0' || c > '9')
    {
        c = getchar_unlocked();
    }
    while (c >= '0' && c <= '9')
    {
        x = (x << 1) + (x << 3) + c - '0';
        c = getchar_unlocked();
    }
    return x;
}
void phongbeo();
const int inf = 1e16;
const ll mod2 = 1e9+7;
const int  mod1 = 998244353;
const ll base=67;
int add(int x,int y)
{
    if(x+y>=mod2) x-=mod2;
    if(x+y<0)x+=mod2;
    return x+y;
}
struct icd
{
    long double a;
    int b;
};
struct ib
{
    int a;
    int b;
};
struct ic
{
    int a,b,c;
};
struct id
{
    int a, b, c, d;
};
struct ie
{
    int a, b, c, d, e;

};
ll  n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
ll  i, s10, s12,k1,k2,k3,s11,lim,w,l,r ;
ll kk;
int a[5001],b[5001],c[5001];
void solve(int N)
{
    n=N;
    if(n==2)
    {
        answer(1,1);
        answer(2,2);
        return;
    }
    for(int i=1; i<n; i++)
        a[i]=query(i,i+1);
    for(int i=1; i<n-1; i++)
        b[i]=query(i,i+2);
    c[1]=0;
    c[2]=c[1]+a[1];
    s4=1;
    for(int i=3; i<=n; i++)
    {
        if(b[i-2]!=a[i-1]+a[i-2])
            s4=-s4;
        c[i]=c[i-1]+a[i-1]*s4;
    }
    s2=-1;
    s3=n+1;
    for(int i=1; i<=n; i++)
        if(c[i]<s3)
        {
            s3=c[i];
            s2=i;
        }
    bool de=0;
    for(int i=s2+1; i<=n; i++)
        if(c[i]==s3+n-1)
        {
            de=1;
        }
    if(!de) s4=-1;
    else s4=1;
    for(int i=1; i<=n; i++)
        c[i]=c[i]*s4;
    s2=-1;
    s3=n+1;
    for(int i=1; i<=n; i++)
        if(c[i]<s3)
        {
            s3=c[i];
            s2=i;
        }
    for(int i=1; i<=n; i++)
        answer(i,c[i]-s3+1);
}