#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;
    
    

    while (Q--) {
        int n;
        cin >> n;
        vector<int>d, c, h, s;
        for (int i = 0; i < n; i++) {
            string p;
            cin >> p;
            
            int t;
            if (p[1] == 'A')t = 1;
            else if (p[1] == 'T')t = 10;
            else if (p[1] == 'J')t = 11;
            else if (p[1] == 'Q')t = 12;
            else if (p[1] == 'K')t = 13;
            else t = p[1] - '0';
            if (p[0] == 'D') {
                d.push_back(t);
            }
            if (p[0] == 'C') {
                c.push_back(t);
            }
            if (p[0] == 'H') {
                h.push_back(t);
            }
            if (p[0] == 'S') {
                s.push_back(t);
            }
        }
            sort(d.begin(), d.end());
            sort(c.begin(), c.end());
            sort(h.begin(), h.end());
            sort(s.begin(), s.end());
            for (int i = 0; i < d.size(); i++) {
                cout << 'D';
                if (d[i] == 1)cout << 'A';
                else if (d[i] == 10)cout << 'T';
                else if (d[i] == 11)cout << 'J';
                else if (d[i] == 12)cout << 'Q';
                else if (d[i] == 13)cout << 'K';
                else cout << d[i];
                cout << " ";
            }
            for (int i = 0; i < c.size(); i++) {
                cout << 'C';
                if (c[i] == 1)cout << 'A';
                else if (c[i] == 10)cout << 'T';
                else if (c[i] == 11)cout << 'J';
                else if (c[i] == 12)cout << 'Q';
                else if (c[i] == 13)cout << 'K';
                else cout << c[i];
                cout << " ";
            }
            for (int i = 0; i < h.size(); i++) {
                cout << 'H';
                if (h[i] == 1)cout << 'A';
                else if (h[i] == 10)cout << 'T';
                else if (h[i] == 11)cout << 'J';
                else if (h[i] == 12)cout << 'Q';
                else if (h[i] == 13)cout << 'K';
                else cout << h[i];
                cout << " ";
            }
            for (int i = 0; i < s.size(); i++) {
                
                cout << 'S';
                if (s[i] == 1)cout << 'A';
                else if (s[i] == 10)cout << 'T';
                else if (s[i] == 11)cout << 'J';
                else if (s[i] == 12)cout << 'Q';
                else if (s[i] == 13)cout << 'K';
                else cout << s[i];
                cout << " ";
            }
        

        
    }

    return 0;
}