#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef complex<double> C;

string parce(int x) {
    int p = x/20;
    string ret;
    switch (p) {
    case 1:
        ret += "D";
        break;
    case 2:
        ret += "C";
        break;
    case 3:
        ret += "H";
        break;
    case 4:
        ret += "S";
        break;
    }
    x %= 20;
    switch (x) {
        case 13:
            ret += "K";
            break;
        case 12:
            ret += "Q";
            break;
        case 11:
            ret += "J";
            break;
        case 10:
            ret += "T";
            break;
        case 1:
            ret += "A";
            break;
        default:
            ret += '0'+x;
            break;
    }
    return ret;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> perm;
    for (int i = 0; i < N; i++) {
        string s;
        cin >> s;
        int tmp = 0;
        switch (s[0]) {
        case 'D':
            tmp += 20;
            break;
        case 'C':
            tmp += 40;
            break;
        case 'H':
            tmp += 60;
            break;
        case 'S':
            tmp += 80;
            break;
        }
        switch (s[1]) {
        case 'K':
            tmp += 13;
            break;
        case 'Q':
            tmp += 12;
            break;
        case 'J':
            tmp += 11;
            break;
        case 'T':
            tmp += 10;
            break;
        case 'A':
            tmp += 1;
            break;
        default:
            tmp += s[1]-'0';
        }
        perm.push_back(tmp);
    }
    sort(perm.begin(), perm.end());
    for (int i = 0; i < perm.size(); i++) {
        cout << parce(perm[i]) ;
        if (i < (perm.size())-1) cout << " ";
    }
    cout << endl;
    return 0;
}