#include <bits/stdc++.h>
using namespace std;
const int N = 120;
string sys; int T, n, a[N], S;
int BIT = 8;
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) {
					cout << a[l] << " " << a[l + 1] << " ";
					l += 2;
				} else {
					cout << a[r] << " " << a[r - 1] << " ";
				}
			}
			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+=2) {
				if (a[i] < a[i + 1]) {
					if (a[i + 1] < a[i + 2]) S |= (1 << (i - 1));
					else i --, S |= (1 << (i - 1));
				} else {
					if (a[i + 1] > a[i + 2]) ;
					else i --;
				}
			}
			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 ("");
			}
		}
	}
}