#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <map>
#include <unordered_map>
#include <deque>
#include <queue>
#include <cmath>
#include <math.h>
#include <unordered_set>
#include <fstream>
#include <sstream>
#include <stdio.h>
#include <climits>
#include <utility>
#include <iterator>
#include <limits>
#include <tuple>
#include <iomanip>
#include <random>
#include <ctime>
#include <chrono>
#include <random>

#define ull unsigned long long int
#define ll long long int
#define ld long double
#define pb push_back
#define str std::string
#define vec std::vector
#define hash_table std::unordered_map
#define prnt(v, end) \
  for (auto i : v)   \
    std::cout << i << end;
#define print(arr, n, end)    \
  for (int i = 0; i < n; ++i) \
    std::cout << arr[i] << end;
#define endl std::cout << "\n";
#define FASTIO                      \
  std::ios::sync_with_stdio(false); \
  std::cin.tie(nullptr);            \
  std::cout.tie(nullptr);

const int inf = 1e9 + 7;
const int64_t INF = 1e18 + 7;
const double pi = 2 * acos(0);
int64_t gcd(int64_t a, int64_t b) { return b == 0 ? a : gcd(b, a % b); }
int64_t lcm(int64_t a, int64_t b) { return a / gcd(a, b) * b; }
int64_t len(int64_t n)
{
  int64_t i = 0;
  while (n > 0)
  {
    ++i;
    n /= 10;
  }
  return i;
}
ull mod_pow(ull a, ull b, ull m = INF)
{
  ull res = 1;
  while (b > 0)
  {
    if (b & 1)
    {
      res *= (ull)a % m;
      res %= m;
    }
    a *= (ull)a % m;
    a %= m;
    b >>= 1;
  }
  return res % m;
}
int64_t prime_mod_inv(int64_t a, int64_t p) { return mod_pow(a, p - 2, p); }
bool is_prime(int64_t x)
{
  if (x <= 3)
    return x >= 2;
  if (x % 2 == 0)
    return false;
  for (int64_t d = 3; d * d <= x; d += 2)
  {
    if (x % d == 0)
      return false;
  }
  return true;
}
int64_t modinv(int a, int m)
{
  int64_t m0 = m, y = 0, x = 1;
  if (m == 1)
    return 0;
  while (a > 1)
  {
    int64_t q = a / m, t = m;
    m = a % m;
    a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0)
    x += m0;
  return x;
}

bool allSet(int n)
{
  return (((n + 1) & n) == 0);
}
bool kthSet(int n, int k)
{
  return n & (1LL << k);
}

int main()
{
  FASTIO;
  int t;
  std::cin >> t;
  while (t--)
  {
    int n;
    std::cin >> n;
    vec<int> x(n);
    for (int i = 0; i < n; ++i)
      std::cin >> x[i];
    vec<int> y(n, 0);
    for (int i = 0; i + 1 < n; ++i)
    {
      int a = y[i] ^ x[i];
      for (int k = 31; k >= 0; --k)
        if (kthSet(a, k) && !kthSet(x[i + 1], k))
        {
          y[i + 1] += 1LL << k;
        }
    }
    for (int in : y)
      std::cout << in << " ";
    endl;
  }
}
