// Author : hejinming2012
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define dbg(x) cout << #x " = " << (x) << endl
#define quickio ios::sync_with_stdio(false);
#define quickin cin.tie(0);
#define quickout cout.tie(0);
#define maxn 300005
using namespace std;
inline int read() {
    int now = 0, nev = 1; char c = getchar();
    while(c < '0' || c > '9') { if(c == '-') nev = -1; c = getchar(); }
    while(c >= '0' && c <= '9') { now = (now << 1) + (now << 3) + (c & 15); c = getchar(); }
    return now * nev;
}
void write(int x) {
    if(x < 0) putchar('-'), x = -x;
    if(x > 9) write(x / 10);
    putchar(x % 10 + '0');
}
int n, a[maxn];
bool ok;
void work() {
    int i, k = 1, j = 1ll << 30;
    for( ; j; j >>= 1) {
        for(i = k; i <= n; i++)
            if(a[i] & j) break ;
        if(i > n) continue ;
        swap(a[i], a[k]);
        for(i = 1; i <= n; i++)
            if(i != k && a[i] & j) a[i] ^= a[k];
        k++;
    }
    k--;
    if(k != n) ok = 1;
    else ok = 0;
    n = k;
}
signed main() {
    quickio
    quickin
    quickout
    int T = read();
    while(T--) {
        n = read(); int sum = 0;
        int tmp = (1ll << n) - 1;
        swap(n, tmp);
        for(int i = 1; i <= n; i++)
            a[i] = read(), sum ^= a[i];
        if(n == 1) {
            write(a[1]), putchar(10);
            continue ;
        }
        if(sum != 0) {
            write(-1), putchar(10);
            continue ;
        }
        work();
        while(tmp > n) write(0), putchar(' '), tmp--;
        for(int i = n; i >= 1; i--)
            write(a[i]), putchar(' ');
        putchar(10);
    }
    return 0;
}