#include <iostream>
#include <algorithm>
using namespace std;
struct data {
string a;
};
int cmp (data a, data b) {
if ((a.a+b.a)<(b.a+a.a)) return 1;
else return 0;
}
main () {
int t;
cin>>t;
int m;
struct data ma[15];
for (int i=1; i<=t; i++) {
cin>>m;
for (int j=1; j<=m; j++) {
cin>>ma[j].a;
}
sort (ma+1, ma+m+1, cmp);
string in="";
for (int j=1; j<=m; j++) {
in+=ma[j].a;
}
cout<<in<<endl;
}
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwogCnN0cnVjdCBkYXRhIHsKCXN0cmluZyBhOwp9OwogCmludCBjbXAgKGRhdGEgYSwgZGF0YSBiKSB7CglpZiAoKGEuYStiLmEpPChiLmErYS5hKSkgcmV0dXJuIDE7CgllbHNlIHJldHVybiAwOwp9CiAKbWFpbiAoKSB7CglpbnQgdDsKCWNpbj4+dDsKCQoJaW50IG07CglzdHJ1Y3QgZGF0YSBtYVsxNV07Cglmb3IgKGludCBpPTE7IGk8PXQ7IGkrKykgewoJCWNpbj4+bTsKCQlmb3IgKGludCBqPTE7IGo8PW07IGorKykgewoJCQljaW4+Pm1hW2pdLmE7CgkJfQoJCXNvcnQgKG1hKzEsIG1hK20rMSwgY21wKTsKCQlzdHJpbmcgaW49IiI7CgkJZm9yIChpbnQgaj0xOyBqPD1tOyBqKyspIHsKCQkJaW4rPW1hW2pdLmE7CgkJfQoJCWNvdXQ8PGluPDxlbmRsOwoJfQp9IA==