#include<bits/stdc++.h>
#define rep(i,x,y) for(int i=x;i<=y;++i)
#define per(i,x,y) for(int i=x;i>=y;--i)
#define lon long long
using namespace std;
const int n7=105;
int n,T,a[n7];

int rd(){
	int shu=0;bool fu=0;char ch=getchar();
	while( !isdigit(ch) ){if(ch=='-')fu=1;ch=getchar();}
	while( isdigit(ch) )shu=(shu<<1)+(shu<<3)+ch-'0',ch=getchar();
	return fu?-shu:shu;
}

namespace Task1{
	void solve(){
		T=rd();
		while(T--){
			n=rd();int s=0;
			rep(i,1,n)a[i]=rd(),s=(s+a[i])%501;
			sort(a+1,a+n+1);
			int l=0,r=n+1;bool las=0;
			per(i,8,0){
				if( s&(1<<i) )printf("%d %d ",a[l+1],a[l+2]),l=l+2,las=1;
				else printf("%d %d ",a[r-1],a[r-2]),r=r-2,las=0;
			}
			if(las)printf("%d ",a[l+1]),l++;
			else printf("%d ",a[r-1]),r--;
			rep(i,l+1,r-1)printf("%d ",a[i]);
			putchar('\n');
		}
	}
}

namespace Task2{
	void solve(){
		T=rd();
		while(T--){
			n=rd();int s=0;
			rep(i,1,n)a[i]=rd(),s=(s+a[i])%501;
			int s0=0;
			for(int i=1;i<18;i=i+2){
				int x=(a[i]<a[i+1]);
				if( (a[i]<a[i+1])^(a[i+1]<a[i+2]) )i--;
				s0=(s0*2+x)%501;
			}
			rep(i,1,n)printf("%d ",a[i]);
			if(s0^s)printf("%d ",abs(s0-s));
			putchar('\n');
		}
	}
}

int main(){
	char sys[9];
	scanf("%s",sys);
	if(sys[0]=='t')Task1::solve();
	else Task2::solve();
	return 0;
}