#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int val (string c) {
    int ret = 0;
    if (c[0] == 'S')
        ret += 40;
    else if (c[0] == 'H')
        ret += 27;
    else if (c[0] == 'C')
        ret += 14;
    if (c[1] == 'A')
        ret++;
    else if (c[1] == 'T')
        ret += 10;
    else if (c[1] == 'J')
        ret += 11;
    else if (c[1] == 'Q')
        ret += 12;
    else if (c[1] == 'K')
        ret += 13;
    else
        ret += stoi(c.substr(1));
    return ret;
}

int main() {
    int i,n;
    string s[52];
    cin >> n;
    rep (i,n) cin >> s[i];
    sort(s,s+n,[](string c1,string c2){return val(c1)<val(c2);});
    rep (i,n) cout << s[i] << " ";
    cout << endl;
    return 0;
}