#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define LINF (ll)INF*INF
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<(n);i++)
#define loop(i,a,n) for(int i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;
typedef vector<pii> vp;

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


signed main(void) {
    int n;
    cin >> n;
    string s = "DCHS";
    vector<vi> v(4);
    rep(i,n){
        string in;
        cin >> in;
        rep(j,4)if(in[0] == s[j]){
            int t = in[1] - '0';
            if(in[1] == 'A')t = 1;
            if(in[1] == 'T')t = 10;
            if(in[1] == 'J')t = 11;
            if(in[1] == 'Q')t = 12;
            if(in[1] == 'K')t = 13;
            v[j].push_back(t);
        }
    }
    vs ans;
    rep(i,4)if(v[i].size()){
        sort(all(v[i]));
        rep(j,v[i].size()){
            char c = '0' + v[i][j];
            if(v[i][j] == 1) c = 'A';
            if(v[i][j] == 10)c = 'T';
            if(v[i][j] == 11)c = 'J';
            if(v[i][j] == 12)c = 'Q';
            if(v[i][j] == 13)c = 'K';
            string tmp = "";
            tmp += s[i];
            tmp += c;
            ans.push_back(tmp);
        }
    }
    rep(i,ans.size())cout << ans[i] << " ";
    cout << endl;
}