#include<bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,const T&y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,const T&y){if(y<x)x=y;}

#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define mem(x) memset((x),0,sizeof(x))

typedef double db;
typedef long long ll;
typedef vector<int>vi;
typedef pair<int,int>pii;

typedef unsigned u32;
typedef unsigned uint;
typedef unsigned long long u64;

namespace orzjk{
  const int SZ=1e6;
  char buf[SZ],*p1=buf,*p2=buf;
  char nc(){
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,SZ,stdin),p1==p2)?EOF:*p1++;
  }
  char fub[SZ],*p3=fub,*p4=fub+SZ;
  void pc(char c){
    p3==p4&&(fwrite(fub,1,SZ,stdout),p3=fub);
    *p3++=c;
  }
  void flush(){
    fwrite(fub,1,p3-fub,stdout),p3=fub;
  }
}
using orzjk::nc;
using orzjk::pc;

//#define nc getchar
//#define pc putchar

ll read(){
  ll x=0,f=1;char c=nc();
  while(c<48)c=='-'&&(f=-1),c=nc();
  while(c>47)x=x*10+(c^48),c=nc();
  return x*f;
}
template<class T>void write(T x){
  static char st[41];
  if(!x)return pc(48),void();
  char*p=st;
  if(x<0)x=-x,pc('-');
  for(;x;x/=10)*p++=x%10|48;
  do{
    pc(*--p);
  }while(p!=st);
}

//const int P=1e9+7;
const int P=998244353;
int qp(int a,int k){
  int res=1;for(;k;k>>=1,a=1ll*a*a%P)if(k&1)res=1ll*res*a%P;return res;
}

const int maxn=1e5+10;
int n,a[maxn];

#define mid ((l+r)/2)

int tot,rt[maxn];
struct node{
  int ls,rs,sum;
}tr[maxn*20];
void ins(int&k,int rt,int l,int r,int x){
  tr[k=++tot]=tr[rt],tr[k].sum++;
  if(l<r){
    if(x<=mid)ins(tr[k].ls,tr[rt].ls,l,mid,x);
    else ins(tr[k].rs,tr[rt].rs,mid+1,r,x);
  }
}
int ask(int k,int l,int r,int ql,int qr){
  if(!k||ql>qr)return 0;
  if(ql<=l&&r<=qr)return tr[k].sum;
  int res=0;
  if(ql<=mid)res=ask(tr[k].ls,l,mid,ql,qr);
  if(qr>mid)res+=ask(tr[k].rs,mid+1,r,ql,qr);
  return res;
}

#undef mid

int tim,c[maxn],clo[maxn];
void add(int pos){
  for(;pos<=n;pos+=pos&-pos){
    if(clo[pos]!=tim)clo[pos]=tim,c[pos]=0;
    c[pos]++;
  }
}
int ask(int pos){
  int res=0;
  for(;pos;pos&=pos-1)res+=(clo[pos]==tim)*c[pos];
  return res;
}

void solve(){
  n=read();
  rep(i,1,n)a[i]=read();
  
  tot=0;
  rep(i,1,n)rt[i]=rt[i-1],ins(rt[i],rt[i-1],1,n,a[i]);
  
  ll all=0;
  rep(i,1,n)all+=ask(rt[i-1],1,n,a[i]+1,n);
  
  static ll ans[maxn];
  ans[1]=all;
  multiset<ll>can;
  can.insert(all);
  
  set<int>S;
  S.insert(0);
  S.insert(n+1);
  rep(_,1,n){
//    cout<<endl;
//    for(ll x:can)cout<<x<<' ';
//    cout<<endl;
    ll las=*can.rbegin();
    write(las),pc("\n "[_<n]);
    int x=read()^las;
    int l=*--S.lower_bound(x)+1;
    int r=*S.lower_bound(x)-1;
    S.insert(x);
    
    ll cur=ans[l];
    can.erase(can.find(cur));
    tim++;
    if(x-l<r-x){
      ans[l]=0;
      per(i,x-1,l)add(a[i]),ans[l]+=ask(a[i]-1);
      ans[x+1]=cur-ans[l];
      rep(i,l,x)ans[x+1]-=ask(rt[r],1,n,1,a[i]-1)-ask(rt[x-1],1,n,1,a[i]-1);
    }else{
      ans[x+1]=0;
      per(i,r,x+1)add(a[i]),ans[x+1]+=ask(a[i]-1);
      ans[l]=cur-ans[x+1];
      rep(i,x,r)ans[l]-=ask(rt[x],1,n,a[i]+1,n)-ask(rt[l-1],1,n,a[i]+1,n);
    }
    if(l<x)can.insert(ans[l]);
    if(x<r)can.insert(ans[x+1]);
  }
}

signed main(){
//  freopen(".in","r",stdin);
//  freopen(".out","w",stdout);
  int T;cin>>T;while(T--)solve();
//  solve();
  orzjk::flush();
  return 0;
}