#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define rrep(i,n) for( int i = n; i >= 0; i-- )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define RREP(i,s,t) for( int i = s; i >= t; i-- )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

char num[13] = { '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D' };
char sign[13] = { 'A', '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K' };

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
	int N; cin >> N;
	vector<char> v[4];
	map<char, char> num2;
	map<char, char> sign2;
	rep(i, 13) sign2[num[i]] = sign[i];
	rep(i, 13) num2[sign[i]] = num[i];
	rep(i, N) {
		string S; cin >> S;
		if (S[0] == 'D') v[0].push_back(num2[S[1]]);
		else if (S[0] == 'C') v[1].push_back(num2[S[1]]);
		else if (S[0] == 'H') v[2].push_back(num2[S[1]]);
		else if (S[0] == 'S') v[3].push_back(num2[S[1]]);
	}
	rep(i, 4) {
		sort(v[i].begin(), v[i].end());
	}
	char s[4] = { 'D', 'C', 'H', 'S' };
	int cnt = 0;
	rep(i, 4) {
		rep(j, v[i].size()) {
			if (cnt != 0) cout << " ";
			cout << s[i] << sign2[v[i][j]];
			cnt++;
		}
	}

    return 0;
}