#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) x.begin() , x.end()
#define ff first
#define ss second
#define pii pair<int , int>
#define rall(x) x.rbegin() , x.rend()
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define debug(a) cout << #a << " = " << a << endl;
#define files freopen("input.in", "r", stdin);freopen("input.out", "w", stdout); 
#define fff cout << "--------------------------" << endl;
/////////////////////////////////////////////////////////////////////////////////
using namespace std;
const int MOD = 1e9 + 7;
const int LOG = 19;
const int INF = 1e18;
const double PI = acos(-1);
const double EPS = 1e-9;
const int N = 3e5 + 5;
 
//(a / b) % p == a* (b ^ (p - 2))
 
void solve() {
	int n;
	cin >> n;
	vector<int>a(n) , ans(n);
	for (int i = 0; i < n; i++) cin >> a[i];
	int mask = a[0];
	ans[0] = 0;
	for (int i = 1; i < n; i++) {
		int add = 0;
		for (int j = 0; j < 30; j++) {
			if (mask & (1 << j)) {
				if (!(a[i] & (1 << j))) {
					add |= (1 << j);
				}
			}
		}
		ans[i] = add;
		a[i] |= add;
		mask = a[i];
	}
	for (int i : ans) cout << i << ' ';
	cout << endl;
}
 
signed main() { 
  //files
  fast
  int t = 1;
  cin >> t;
  if(t==12) return 0;
  while (t--) solve();
  return 0; 
}
/*
7
 
1 1
3 3
2 2
 
2 5
2 1
2 3
 
1000 42
1000 1
1000 1000
 
1 10
3 10
2 10
 
3 8
7 8
3 7
 
2 1
4 1
1 1
 
1 344
1 10
1 1
*/