#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
using namespace std;
const int M=1010;

struct node
{
    char name[105];
    int num;
} a[105];

bool cmp(node x,node y)
{
    return x.num>y.num;

}

int change(char *a,int l)
{
    int sum=0;
    sum=(a[l-4]-'0')*1000+(a[l-3]-'0')*100+(a[l-2]-'0')*10+(a[l-1]-'0');

    return sum;

}



char s[105];

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        getchar();
        for(int i=0; i<n; ++i)
        {
            gets(s);

            int l=strlen(s);

            a[i].num=change(s,l);
            s[l-5]='\0';
            strcpy(a[i].name,s);


        }
        //printf("%s\n",s);


        sort(a,a+n,cmp);

        for(int i=0;i<n;++i)
        {

            cout<<a[i].name<<endl;


        }


    }


    return 0;


}