#include <bits/stdc++.h>
using namespace std;

#define BIT(x) (1ull << (x))
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) do {sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end());} while (0)
#define PB push_back
#define MP make_pair
#define SIZE(v) ((int)(v).size())
#define DEBUG(x) cout << #x << " = " << x << endl


int n;
string s[52];
int r[256];


bool cmp(const string &a, const string &b)
{
	REP(i, 2) if (r[a[i]] != r[b[i]]) return r[a[i]] < r[b[i]];
}

int main()
{
	const string S = "DCHS";
	const string T = "A23456789TJQK";
	REP(i, SIZE(S)) r[S[i]] = i;
	REP(i, SIZE(T)) r[T[i]] = i;
	
	scanf("%d", &n);
	REP(i, n) cin >> s[i];
	sort(s, s + n, cmp);
	REP(i, n) cout << s[i] << " \n"[i == n - 1];
}