#include <bits/stdc++.h>
using namespace std;
const int N = 120;
string sys; int T, n, a[N], S;
int BIT = 8;
bool pd[N];
int main () {
	cin >> sys;
	if (sys[0] == 't') {
		cin >> T;
		while (T --) {
			cin >> n; for (int i=1;i<=n;i++) cin >> a[i];
			S = 0;
			for (int i=1;i<=n;i++) S ^= a[i];
			sort (a + 1, a + n + 1); int l = 1, r = n;
			for (int i=0;i<=8;i++) {
				if (S & (1 << i)) {
					cout << a[l] << " " << a[l + 1] << " ";
					l += 2;
				} else {
					cout << a[r] << " " << a[r - 1] << " ";
					r -= 2;
				}
			}
			for (int i=l;i<=r;i++) cout << a[i] << " ";
			cout << endl;
		}
	} else {
		cin >> T;
		while (T --) {
			cin >> n; for (int i=1;i<=n;i++) cin >> a[i];
			for (int i=1;i<=18;i++) if (a[i] < a[i + 1]) pd[i] = 1; else pd[i] = 0;
			int pos = 0, m = 18; S = 0;
			for (int l=1,r;l<=m;l=r+1) {
				r = l; while (pd[r] == pd[l] && r <= m) r ++; r --;
				if ((r - l + 1) % 2 == 1) {
					for (int i=m;i>=r+1;i--) pd[i] = pd[i - 1];
					pd[r + 1] = pd[l]; r ++;
					int len = r - l + 1;
					while (len) {
						S |= (pd[l] << pos);
						len -= 2; pos ++;
					}
				} else {
					int len = r - l + 1;
					while (len) {
						S |= (pd[l] << pos);
						len -= 2; pos ++;
					}
				}
			}
			int TS = 0;
			for (int i=1;i<=n;i++) TS ^= a[i];
			TS ^= S;
			if (! TS) {
				for (int i=1;i<=n;i++) cout << a[i] << " "; puts ("");
			} else {
				for (int i=1;i<=n;i++) cout << a[i] << " "; cout << TS << " "; puts ("");
			}
		}
	}
}