#include<cstdio>
#include<algorithm>
using namespace std;
const int N=110;
int T,n,a[N];
namespace Transmit{
	int res[N],tot,sum,l,r;
	void solve(){
		tot=sum=0;
		l=1;r=n;
		sort(a+1,a+n+1);
		for(int i=1;i<=n;i++){
			sum^=a[i];
		}
		for(int j=8;j>=0;j--){
			if(sum&(1<<j)){
				res[++tot]=a[r--];
				res[++tot]=a[r--];
			}else{
				res[++tot]=a[l++];
				res[++tot]=a[l++];
			}
		}
		for(int i=l;i<=r;i++)res[++tot]=a[i];
		for(int i=1;i<=n;i++)printf("%d ",res[i]);
		printf("\n");
	}
}
namespace Recover{
	int sum,res;
	void solve(){
		sum=res=0;
		for(int i=1,p=1;i<=9;i++){
			sum<<=1;
			if(a[p]>a[p+1])sum|=1;
			if((a[p]>a[p+1])==(a[p+1]>a[p+2]))p+=2;
			else p++;
		}
		for(int i=1;i<=n;i++){
			printf("%d ",a[i]);
			res^=a[i];
		}
		if(sum!=res)printf("%d ",sum^res);
		printf("\n");
	}
}
int main(){
	char ch[11];
	scanf("%s",ch);
	scanf("%d",&T);
	while(T--){
		scanf("%d",&n);
		for(int i=1;i<=n;i++)scanf("%d",&a[i]);
		if(ch[0]=='t')Transmit::solve();
		else Recover::solve();
	}
}