#include <iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define req(i,n) for(int i = 1;i <=  n; i++)
#define rrep(i,n) for(ll i = n-1;i >= 0;i--)
#define ALL(obj) begin(obj), end(obj)
#define RALL(a) rbegin(a),rend(a)
typedef long long ll;
typedef long double ld;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;
ll mod = 1e9 + 7;
int main() {
    int n; cin >> n; vector<int> a;
    char c, d;
    rep(i, n) {
        cin >> c >> d;
        int num = 0;
        if (c == 'D')num += 100;
        else if (c == 'C')num += 200;
        else if (c == 'H')num += 300;
        else num += 400;
        if (d == 'A') num += 1;
        else if (d == 'T') num += 10;
        else if (d == 'J') num += 11;
        else if (d == 'Q') num += 12;
        else if (d == 'K') num += 13;
        else num += (int)(d - '0');
        a.push_back(num);
    }sort(ALL(a));
    for (int i : a) {
        if (i / 100 == 1) cout << "D";
        else if (i / 100 == 2)cout << "C";
        else if (i / 100 == 3)cout << "H";
        else cout << "S";
        if (i % 100 == 10)cout << "T ";
        else if (i % 100 == 11)cout << "J ";
        else if (i % 100 == 12)cout << "Q ";
        else if (i % 100 == 13)cout << "K ";
        else if (i % 10 == 1)cout << "A ";
        else cout << i % 10 << " ";
    }cout << endl;
}