#include <iostream>
#include <vector>
#include <algorithm>
#define pb push_back
using namespace std;
void transmit() {
	int n;
	cin >> n;
	vector <int> a(n, 0);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	vector <int> ans;
	int xsum = 0;
	for (int i = 0; i < n; i++) {
		xsum ^= a[i];
	}
	int l = 0, r = n - 1;
	for (int i = 0; i < 8; i++) {
		if (xsum >> i & 1) { 
			ans.pb(a[r--]), ans.pb(a[r--]);
		}
		else {
			ans.pb(a[l++]), ans.pb(a[l++]);
		}
	}
	if (xsum & 256) {
		ans.pb(a[l++]);
	}
	else ans.pb(a[r--]);
	for (int i = l; i <= r; i++) {
		ans.pb(a[i]);
	}
	for (int i = 0; i < n; i++) {
		cout << ans[i] << ' ';
	}
	cout << '\n';
}
void recover() {
	int n;
	cin >> n;
	vector <int> a(n + 3, 0);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		cout << a[i] << ' ';
	}
	int xsum = 0;
	for (int i = 1; i <= n; i++) {
		xsum ^= a[i];
	}
	vector <int> ls(20, 0)/*, ans*/;
	ls[0] = -1;
	for (int i = 1; i <= 18; i++) {
		ls[i] = a[i] > a[i + 1];
	}
	int cnt = 0, pos = 0;
	for (int i = 1; i <= 18; i++) {
		if (ls[i] ^ ls[i - 1]) {
			if (cnt & 1) {
				pos = i;
			}
			cnt = 1;
		}
		else {
			cnt = 1 + cnt;
		}
	}
	if (pos) {
		for (int i = 17; i >= pos - 1; i--) {
			ls[i + 1] = ls[i];
		}
	}
	int ans = 0;
	for (int i = 0; i <= 8; i++) {
		if (ls[i << 1 | 1]) {
			ans |= (1 << i);
		}
	}
	if (ans ^ xsum) cout << (ans ^ xsum);
	cout << '\n';
}
int main() {
	ios::sync_with_stdio(0);
	string s;
	cin >> s;
	int t;
	cin >> t;
	while (t--) {
		if (s == "transmit") transmit();
		else recover();
	}
}