#include<iostream>
#include<math.h>
#include<vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) //printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/
int num(string card) {
    char n = card[1];
    switch (n) {
        case 'A': return 1;
        case 'T': return 10;
        case 'J': return 11;
        case 'Q': return 12;
        case 'K': return 13;
        default: return atoll(card.substr(1).c_str());
    }
}

int mark(string card) {
    char n = card[0];
    switch (n) {
        case 'D': return 1;
        case 'C': return 2;
        case 'H': return 3;
        case 'S': return 4;
    }
    return 4;
}

class comp {
public:
    bool operator()(string s1, string s2) const {
        int n1 = mark(s1);
        int n2 = mark(s2);
        if (n1 != n2) return n1 < n2;
        return num(s1) < num(s2);
    }
};

signed main()
{
    int n;
    cin >> n;
    vector<string> cards(n);
    REP(i,n) {
        cin >> cards[i];
    }
    sort(ALL(cards), comp());
    REP(i,cards.size()) {
        if (i > 0) cout << " ";
        cout << cards[i];
    }
    cout << endl;

    return 0;
}