#include<iostream>
#include <bits/stdc++.h>

#define ld long double
#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 30, mod = 998244353;
int basis[N];

bool add(int mask) {
    for (int i = 0; i < N; i++) {
        if ((mask & 1 << i) == 0)continue;
        if (!basis[i]) {
            basis[i] = mask;
            return true;
        }
        mask ^= basis[i];
    }
    return false;
}

vector<int> query(vector<int> &ans) {
    vector<int> res;
    int n = ans.size();
    for (int mask = 0; mask < (1 << n); mask++) {
        int cur = 0;
        for (int i = 0; i < n; i++) {
            if ((mask & 1 << i) != 0) {
                cur ^= ans[i];
            }
        }
        res.push_back(cur);
    }
    sort(res.begin(), res.end());
    return res;
}

void doWork() {
    memset(basis, 0, sizeof basis);
    int n;
    cin >> n;
    vector<int> a(1 << n, 0);
    for (int i = 1; i < (1 << n); i++) {
        cin >> a[i];
    }
    sort(a.begin(), a.end());
    vector<int> ans;
    for (auto i: a) {
        if (add(i)) {
            ans.push_back(i);
        }
    }
    while (ans.size() < n) {
        ans.insert(ans.begin(), 0);
    }
    if (ans.size() > n) {
        cout << -1 << "\n";
        return;
    }

    if (a != query(ans)) {
        cout << "-1\n";
        return;
    }
    for (auto i: ans)cout << i << " ";
    cout << "\n";
}

int main() {
    IO
    int t = 1;
    cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}