#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <string>
#include <tuple>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <random>
//#include "toollib.h"
#define INT_MAX 2147483647
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#pragma warning (disable:4018)

using namespace std;
typedef long long int lint;

typedef struct {
	int x;
	int y;
}coordinate;

//***** Main Program *****

void hoge1(vector<int>* ary, char c) {
	if (c == 'A') (*ary).push_back(1);
	else if (c == 'T') (*ary).push_back(10);
	else if (c == 'J') (*ary).push_back(11);
	else if (c == 'Q') (*ary).push_back(12);
	else if (c == 'K') (*ary).push_back(13);
	else (*ary).push_back((int)(c - '0'));
}

void hoge2(vector<int> ary, char c) {
	Loop(i, ary.size()) {
		cout << c;
		if (ary[i] == 1) cout << "A ";
		else if (ary[i] == 10) cout << "T ";
		else if (ary[i] == 11) cout << "J ";
		else if (ary[i] == 12) cout << "Q ";
		else if (ary[i] == 13) cout << "K ";
		else cout << ary[i] << " ";
	}
}

int main() {
	int N;
	cin >> N;
	vector<string> S(N);
	vector<int> d, c, h, s;
	Loop(i, N) {
		cin >> S[i];
		if (S[i][0] == 'D') hoge1(&d, S[i][1]);
		if (S[i][0] == 'C') hoge1(&c, S[i][1]);
		if (S[i][0] == 'H') hoge1(&h, S[i][1]);
		if (S[i][0] == 'S') hoge1(&s, S[i][1]);
	}
	sort(d.begin(), d.end());
	sort(c.begin(), c.end());
	sort(h.begin(), h.end());
	sort(s.begin(), s.end());
	hoge2(d, 'D');
	hoge2(c, 'C');
	hoge2(h, 'H');
	hoge2(s, 'S');
	cout << endl;
	return 0;
}