#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

const int dy[] = { 0, 1, 0, -1 };
const int dx[] = { 1, 0, -1, 0 };

using LL = long long int;
using LD = long double;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;

//==============================================
// D C H S
// A B C D
string conversion(char c) {
	if (c == 'D') return "A";
	else if (c == 'C') return "B";
	else if (c == 'H') return "C";
	else return "D";
}

char restitute(char c) {
	if (c == 'A') return 'D';
	else if (c == 'B') return 'C';
	else if (c == 'C') return 'H';
	else return 'S';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int n;
	cin >> n;

	vs M(n);

	for (int i = 0; i < n; i++) {
		string s;
		cin >> s;

		string a = conversion(s[0]);
		string b;
		if (s[1] == 'A') b = "1";
		else if (s[1] == 'T') b = "90";
		else if (s[1] == 'J') b = "91";
		else if (s[1] == 'Q') b = "92";
		else if (s[1] == 'K') b = "93";
		else b = s[1];

		M[i] = a + b;
	}

	SORT(M);

	for (int i = 0; i < n; i++) {
		string s;
		s = restitute(M[i][0]);

		if (M[i].size() == 3) {
			if (M[i][2] == '0') s += "T";
			else if (M[i][2] == '1') s += "J";
			else if (M[i][2] == '2') s += "Q";
			else if (M[i][2] == '3') s += "K";
		} else {
			if (M[i][1] == '1') s += "A";
			else s += M[i][1];
		}

		if (i) cout << " ";
		cout << s;
	}
	cout << endl;
	return 0;
}