#include <bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

vector<char> num{'A', '1', '2', '3', '4', '5', '6', '7',
                    '8', '9', 'T', 'J', 'Q', 'K'};

void push(vector<string> v){
    for (int i = 0; i < 14; i++){
        for (int j = 0; j < v.size(); j++){
            if (num[i] == v[j][1]) {
                cout << v[j] << " ";
                v.erase(v.begin()+j);
            }
        }
    }
} 

int main()
{
    int n;
    cin >> n;
    vector<string> d, c, h, s;
    for (int i = 0; i < n; i++){
        string t;
        cin >> t;
        if (t[0] == 'D') d.push_back(t);
        else if (t[0] == 'C') c.push_back(t);
        else if (t[0] == 'H') h.push_back(t);
        else s.push_back(t); 
    }
    push(d);
    push(c);
    push(h);
    push(s);
    cout << endl;
}