#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, a[N];
void solve() {
	cin >> n;
	for (int i = 1; i <= n; ++i) cin >> a[i];
	sort(a + 1, a + n + 1);
	for (int i = 2; i <= n; ++i)
		if ((a[i] & a[1]) != a[1]) {
			puts("-1");
			return;
		}
	if (n == 1) {
		cout << a[1] << '\n';
		return;
	}
	for (int i = 2; i <= n; ++i) {
		cout << a[i] << ' ';
		if (i < n)
			cout << a[1] << ' ';
	}
	cout << '\n';
}
int main() {
	int t;
	cin >> t;
	while (t--)
		solve();
}