#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 1e5 + 7 ;

int n ;
int a[ MAXN ] ;
struct node {
    int cnt ;
    int pl , pr ;
    node ( ) { cnt = pl = pr = 0 ; }
};

int tp ;
node tr[ 40 * MAXN ] ;

int root[ MAXN ] ;

int init ( int l , int r ) {
    int ret = ++ tp ;
    if ( l == r ) { return ret ; }
    int mid = ( l + r ) / 2 ;
    tr[ ret ].pl = init ( l , mid ) ;
    tr[ ret ].pr = init ( mid + 1 , r ) ;
    return ret ;
}

int update ( int w , int l , int r , int pos ) {
    int ret = ++ tp ;
    tr[ ret ].cnt = tr[ w ].cnt + 1 ; tr[ ret ].pl = tr[ w ].pl , tr[ ret ].pr = tr[ w ].pr ; 
    if ( l == r ) {
        return ret ;
    }
    int mid = ( l + r ) / 2 ;
    if ( pos <= mid ) { tr[ ret ].pl = update ( tr[ w ].pl , l , mid , pos ) ; }
    else { tr[ ret ].pr = update ( tr[ w ].pr , mid + 1 , r , pos ) ; }
    return ret ;
}

int query ( int w , int l , int r , int st , int en ) {
    if ( l > r || st > en ) { return 0 ; }
    if ( r < st || en < l ) { return 0 ; }
    if ( st <= l && r <= en ) { return tr[ w ].cnt ; }
    int mid = ( l + r ) / 2 ;
    return query ( tr[ w ].pl , l , mid , st , en ) + query ( tr[ w ].pr , mid + 1 , r , st , en ) ;
}

set < int > s ;
multiset < ll > all_vals ;
map < pii , ll > w ;

void solve ( ) {
    cin >> n ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> a[ i ] ;
    }
    tp = 0 ;
    root[ 0 ] = init ( 1 , n ) ;
    ll lstans = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        root[ i ] = update ( root[ i - 1 ] , 1 , n , a[ i ] ) ;
        lstans += query ( root[ i - 1 ] , 1 , n , a[ i ] + 1 , n ) ;
    }
    s.clear ( ) ;
    s.insert ( 0 ) ;
    s.insert ( n + 1 ) ;
    w.clear ( ) ;
    all_vals.clear ( ) ;
    w[ { 0 , n + 1 } ] = lstans ;
    all_vals.insert ( lstans ) ;
    cout << lstans << " " ;

    for ( int i = 1 ; i <= n ; ++ i ) {
        ll x ; cin >> x ;
        x ^= lstans ;
        if ( i == n ) { break ; }
        auto it1 = s.upper_bound ( x ) ;
        auto it2 = s.upper_bound ( x ) ;
        -- it2 ;
        int prv = *it2 , nxt = *it1 ;
        s.insert ( x ) ;
        ll l_side , r_side ;
        ll tot = w[ { prv , nxt } ] ;
        w.erase ( { prv , nxt } ) ;
        auto foo = all_vals.find ( tot ) ;
        all_vals.erase ( foo ) ;

        ll aux = 0 ;
        if ( x - prv < nxt - x ) {
            for ( int i = prv + 1 ; i <= x ; ++ i ) {
                if ( i < x ) { 
                    aux += query ( root[ i - 1 ] , 1 , n , a[ i ] + 1 , n ) - query ( root[ prv ] , 1 , n , a[ i ] + 1 , n ) ;
                }
                else {
                    tot -= query ( root[ i - 1 ] , 1 , n , a[ i ] + 1 , n ) - query ( root[ prv ] , 1 , n , a[ i ] + 1 , n ) ;
                }
                tot -= query ( root[ nxt - 1 ] , 1 , n , 1 , a[ i ] - 1 ) - query ( root[ x ] , 1 , n , 1 , a[ i ] - 1 ) ;
            }
            tot -= aux ;
            w[ { prv , x } ] = aux ;
            w[ { x , nxt } ] = tot ;
            all_vals.insert ( aux ) ;
            all_vals.insert ( tot ) ;
        }
        else {
            for ( int i = x ; i < nxt ; ++ i ) {
                if ( i > x ) {
                    aux += query ( root[ i - 1 ] , 1 , n , a[ i ] + 1 , n ) - query ( root[ x ] , 1 , n , a[ i ] + 1 , n ) ;
                }
                else {
                    tot -= query ( root[ nxt - 1 ] , 1 , n , 1 , a[ i ] - 1 ) - query ( root[ x ] , 1 , n , 1 , a[ i ] - 1 ) ;
                }
                tot -= query ( root[ x - 1 ] , 1 , n , a[ i ] + 1 , n ) - query ( root[ prv ] , 1 , n , a[ i ] + 1 , n ) ;
            }
            tot -= aux ;
            w[ { prv , x } ] = tot ;
            w[ { x , nxt } ] = aux ;
            all_vals.insert ( aux ) ;
            all_vals.insert ( tot ) ;
        }
        lstans = *all_vals.rbegin ( ) ;
        cout << lstans << " " ;
    }
    cout << "\n" ;
    for ( int i = 0 ; i <= tp ; ++ i ) {
        tr[ i ] = node ( ) ;
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}