#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll n;
    cin >> n;
    vector<pair<pair<ll, ll>, string>> v(n);
    map<char, ll> mark;
    mark['D'] = 0;
    mark['C'] = 1;
    mark['H'] = 2;
    mark['S'] = 3;
    map<char, ll> number;
    reps(i, 2, 10) number[(char)('0' + i)] = i;
    number['A'] = 1;
    number['T'] = 10;
    number['J'] = 11;
    number['Q'] = 12;
    number['K'] = 13;
    rep(i, n) {
        string mn;
        cin >> mn;
        v[i].first.first = mark[mn[0]];
        v[i].first.second = number[mn[1]];
        v[i].second = mn;
    }
    sort(all(v));
    rep(i, n) printf("%s%s", v[i].second.c_str(), (i == (n - 1)) ? "\n" : " ");
    return 0;
}