#include<bits/stdc++.h>
using namespace std;
int a[515][25];
int ss[2000005],c[2000005];
int gs[1000005];
int main(){
	mt19937 mt(20051115);
	for(int i=0;i<512;++i){
		for(int j=1;j<=20;++j){
			a[i][j]=j;
		}
		shuffle(a[i]+1,a[i]+21,mt);
	}
	string shj;
	cin>>shj;
	if(shj=="transmit"){
		int T;
		cin>>T;
		while(T--){
			int n;
			scanf("%d",&n);
			for(int i=1;i<=n;++i)scanf("%d",&ss[i]);
			sort(ss+1,ss+n+1);
			int yh=0;
			for(int i=1;i<=n;++i)yh^=ss[i];
			for(int i=1;i<=20;++i)c[i]=ss[a[yh][i]];
			for(int i=21;i<=n;++i)c[i]=ss[i];
			for(int i=1;i<=n;++i)printf("%d ",c[i]);
			printf("\n");
		}
	}else{
		int T;
		cin>>T;
		while(T--){
			int n;
			scanf("%d",&n);
			for(int i=1;i<=n;++i)scanf("%d",&ss[i]);
			int yh=-1;
			for(int dd=0;dd<512;++dd){
				int ff=0;
				for(int i=1;i<=19;++i){
					gs[i]=0;
					for(int j=1;j<=19;++j){
						if(ss[j]<=ss[i])++gs[i];
					}
				}
				for(int wz=1;wz<=20;++wz){
					int gg=0,flag=1;
					for(int i=1;i<=20;++i){
						if(i==wz)continue;
						++gg;
						int fd=a[dd][i]-(a[dd][i]>a[dd][wz]);
						if(fd!=gs[gg]){
							flag=0;
							break;
						}
					}
					ff|=flag;
					if(ff)break;
				}
				if(ff){
					yh=dd;
					break;
				}
			}
			for(int i=1;i<=n;++i)yh^=ss[i];
			if(yh==0){
				for(int i=1;i<=n;++i)printf("%d ",ss[i]);
				printf("\n");
			}else{
				for(int i=1;i<=n;++i)printf("%d ",ss[i]);
				printf("%d\n",yh);
			}
		}
	}
	return 0;
}