#include using namespace std; // #include // using namespace atcoder; #define rep(i, n) for (ll i = 0; i < (n); ++i) #define rep1(i, n) for (ll i = 1; i <= n; ++i) #define reps(i, s, e) for (ll i = s; i <= e; ++i) #define rrep(i, n) for (ll i = n - 1; 0 <= i; --i) #define all(v) v.begin(), v.end() #define endl "\n" template bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } using ll = long long; using ld = long double; using cp = complex; using pa = pair; using tup = tuple; using vp = vector >; using vtup = vector >; using st = string; using vs = vector; using vc = vector; using vvi = vector >; using vvc = vector >; using vi = vector; const ll MOD1 = 1000000007; const ll MOD2 = 998244353; const ll INF = (1LL << 60); void init() { ios_base::sync_with_stdio(false); cin.tie(NULL), cout.tie(NULL); cout << fixed << setprecision(15); } int main() { init(); ll n; cin >> n; vs mn(n); rep(i, n) cin >> mn[i]; vp t(n); rep(i, n) { pa cur; if (mn[i][0] == 'S') { cur.first = 4; } else if (mn[i][0] == 'H') { cur.first = 3; } else if (mn[i][0] == 'C') { cur.first = 2; } else if (mn[i][0] == 'D') { cur.first = 1; } if (mn[i][1] == 'A') { cur.second = 1; } else if (mn[i][1] == 'T') { cur.second = 10; } else if (mn[i][1] == 'J') { cur.second = 11; } else if (mn[i][1] == 'Q') { cur.second = 12; } else if (mn[i][1] == 'K') { cur.second = 13; } else { cur.second = mn[i][1] - '0'; } t[i] = cur; } sort(all(t)); rep(i, n) { if (t[i].first == 1) { cout << "D"; } else if (t[i].first == 2) { cout << "C"; } else if (t[i].first == 3) { cout << "H"; } else if (t[i].first == 4) { cout << "S"; } if (t[i].second == 1) { cout << "A"; } else if (t[i].second == 10) { cout << "T"; } else if (t[i].second == 11) { cout << "J"; } else if (t[i].second == 12) { cout << "Q"; } else if (t[i].second == 13) { cout << "K"; } else { cout << t[i].second; } if (i != n - 1) { cout << " "; } else { cout << endl; } } }