#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <cstring>
#include <functional>
#include <climits>
#include <list>
#include <ctime>
#include <complex>
 
#define F1(x,y,z) for(int x=y;x<z;x++)
#define F2(x,y,z) for(int x=y;x<=z;x++)
#define F3(x,y,z) for(int x=y;x>z;x--)
#define F4(x,y,z) for(int x=y;x>=z;x--)
#define pb push_back
#define LL long long
#define co complex<double>
 
#define MAX 100005
#define AMAX 1500
#define MOD 1000000007

#define f(c,d) ((1<<(c))*(d))

using namespace std;

struct w{
    int cnt,x[2];
} ww;

int t,n,ta,tb,y[MAX],ans[MAX];
vector<w> x;

int main(){
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        x.clear();
        x.pb(ww);
        F2(a,1,n){
            ta=0;
            F4(b,30,0){
                tb=(a&(1<<b))?1:0;
                if(!x[ta].x[tb]){
                    x[ta].x[tb]=x.size();
                    x.pb(ww);
                }
                ta=x[ta].x[tb];
                x[ta].cnt++;
            }
            ans[a]=0;
        }
        F2(a,1,n)scanf("%d",&y[a]);
        F4(a,n,1){
            y[a]-=y[a-1];
            ta=0;
            F4(b,30,0){
                if(!x[ta].x[1])ta=x[ta].x[0];
                else if(x[x[ta].x[1]].cnt>y[a]){
                    ta=x[ta].x[1];
                    ans[a]+=1<<b;
                }
                else{
                    y[a]-=x[x[ta].x[1]].cnt;
                    ta=x[ta].x[0];
                }
                x[ta].cnt--;
            }
        }
        F2(a,1,n)printf("%d%c",ans[a],a==n?'\n':' ');
    }
    //system("pause");
    return 0;
}