#include<bits/stdc++.h>

 using namespace std;

 const int maxn = 1e5 + ;

 struct node{

     string name;

     int id = ;

     int sum = ;

     int maxx = ;

     int maxx2 = ;

 };

 node a[maxn];

 bool cmp(const node &a, const node &b)

 {

     if(a.id != b.id) return a.id > b.id;

     if(a.maxx != b.maxx) return a.maxx > b.maxx;

     if(a.maxx2 != b.maxx2) return a.maxx2 > b.maxx2;

     if(a.sum != b.sum) return a.sum > b.sum;

     return a.name < b.name;

 }

 int v[];

 int main()

 {

     std::ios::sync_with_stdio(false);

     int n;

     string s;

     cin >> n;

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

     {

         cin >> a[i].name >> s;

         int cnt = ;

         for(int j = ;j < s.size();j++)

         {

             if(s[j] == '') continue;

             else if(s[j] == '') v[cnt++] = ;

             else if(s[j] == 'A') v[cnt++] = ;

             else if(s[j] == 'J') v[cnt++] = ;

             else if(s[j] == 'Q') v[cnt++] = ;

             else if(s[j] == 'K') v[cnt++] = ;

             else v[cnt++] = s[j] - '';

         }

         sort(v, v + );

         int vis[] = {};

         for(int j= ;j < ;j++)

         {

             a[i].sum += v[j];

             vis[v[j]]++;

         }

         if(v[] ==  && v[] ==  && v[] ==  && v[] ==  && v[] == ){

             a[i].id = ;continue;

         }

         if(v[] == v[] +  && v[] == v[] +  && v[] == v[] -  && v[] == v[] - ){

             a[i].id = ;

             a[i].maxx = v[];

             continue;

         }

         int two = , three = ;

         int t = , tt = , ttt;

         for(int j = ;j <= ;j++)

         {

             if(vis[j] == ){

                 a[i].id = ;

                 a[i].maxx = j;

                 a[i].sum -= j * ;

                 break;

             }

             if(vis[j] == ) three ++, ttt = j ;

             if(vis[j] == ){

                 two++;

                 if(!t) t = j;

                 else tt = j;

             }

         }

         if(three ==  && two == )

         {

             a[i].id = ;

             a[i].maxx = ttt;

             a[i].maxx2 = t;

             continue;

         }

         if(three == )

         {

             a[i].id = ;

             a[i].maxx = ttt;

             a[i].sum -=  * ttt;

             continue;

         }

         if(two == )

         {

             a[i].id = ;

             a[i].maxx = max(t,tt);

             a[i].maxx2 = min(t,tt);

             a[i].sum -= (t + tt) * ;

         }

         if(two){

             a[i].id = ;

             a[i].maxx = t;

             a[i].sum -= *t;

         }

     }

     sort(a, a + n, cmp);

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

     {

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

         //cout << " " << a[i].id << " " << a[i].maxx << " " << a[i].maxx2 << " "  << a[i].sum << endl;

     }

     return ;

 }