#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define double long double
#define ff first
#define ss second
#define pb push_back
#define pii pair<int,int>
#define all(v) (v).begin(), (v).end()

// for debug
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif

void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(double t) {cerr << t;}

template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}

void solve()
{
	int n;
	cin >> n;
	vector<int> v(n);
	vector<vector<int>> bits(n, vector<int>(32));
	for (int i = 0; i < n; i++)
	{
		cin >> v[i];
		for (int j = 0; j < 32; j++)
		{
			if ((v[i] >> j) & 1) bits[i][j] = 1;
		}
	}
	debug(bits);
	vector<vector<int>> needed(n, vector<int>(32));
	vector<vector<int>> ans(n, vector<int>(32));
	for (int i = 0; i < 32; i++)
	{
		needed[0][i] = bits[0][i];
	}
	for (int i = 1; i < n; i++)
	{
		for (int j = 0; j < 32; j++)
		{
			if (needed[i - 1][j]) needed[i][j] = 1;
		}
		for (int j = 0; j < 32; j++)
		{
			if (needed[i][j] == 1 and bits[i][j] == 0) ans[i][j] = 1;
		}
		for (int j = 0; j < 32; j++)
		{
			needed[i][j] = bits[i][j] xor ans[i][j];
		}
	}
	vector<int> res;
	vector<int> power(32);
	power[0] = 1;
	for (int i = 1; i < 32; i++) power[i] = power[i - 1] * 2;
	for (int i = 0; i < n; i++)
	{
		int cur = 0;
		for (int j = 0; j < 32; j++)
		{
			cur += ans[i][j] * power[j];
		}
		res.pb(cur);
	}
	debug(needed);
	for (auto x : res) cout << x << " ";
	cout << endl;
}

int32_t main()
{
	ios_base:: sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	freopen("debug.txt", "w", stderr);
#endif
#ifdef SEIVE
	seive();
#endif
	int t = 1;
	cin >> t;
	for (int i = 1; i <= t; i++)
	{
		// cout << "Case #" << i << ": ";
		solve();
	}

	return 0;
}