#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <set>
#include <map>
#include <list>
#include <queue>
#include <string>
#include <vector>
#include <fstream>
#include <iterator>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL long long
#define INF 0x3f3f3f3f
#define MOD 1000000007
#define eps 1e-6
#define MAXN 150
#define MAXM 100
#define dd cout<<"debug"<<endl
#define pa {system("pause");}
#define p(x) printf("%d\n", x)
#define pd(x) printf("%.7lf\n", x)
#define k(x) printf("Case %d: ", ++x)
#define s(x) scanf("%d", &x)
#define sd(x) scanf("%lf", &x)
#define mes(x, d) memset(x, d, sizeof(x))
#define do(i, x) for(i = 0; i < x; i ++)
#define dod(i, x, l) for(i = x; i >= l; i --)
#define doe(i, x) for(i = 1; i <= x; i ++)
struct node
{
    string name;
    int age;
};
bool cmp(struct node x, struct node y)
{
    return x.age > y.age;
}
int n, T;
struct node f[MAXN];

int main()
{
    scanf("%d", &T);
    while(T --)
    {
        char name[MAXN];
        scanf("%d", &n);
        getchar();
        for(int i = 0; i < n; i ++)
        {
            gets(name);
            f[i].name = "";
            f[i].age = 0;
            int len = strlen(name);
            for(int j = 0; j < len - 5; j ++)
                f[i].name += name[j];
            for(int j = len - 4; j < len; j ++)
                f[i].age = f[i].age * 10 + (int)(name[j] - '0');
        }
        sort(f, f+n, cmp);
        for(int i = 0; i < n; i ++)
            cout<<f[i].name<<endl;
    }
    return 0;
}