#define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
//#define endl "\n"
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> ostream & operator<<(ostream & os, vector<T> const &);
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; }
template<class T, class U> ostream & operator<<(ostream & os, pair<T,U> const & p){ return os << "(" << p.first << ", " << p.second << ") "; }
template<class T> ostream & operator<<(ostream & os, vector<T> const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; }
template<class T> inline bool chmax(T & x, T const & y){ return x<y ? x=y,true : false; }
template<class T> inline bool chmin(T & x, T const & y){ return x>y ? x=y,true : false; }
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl)
#else
#define dump(...)
#endif
// ll const mod = 1000000007;
// ll const inf = 1LL<<60;

signed main(){
    int n;
    while(cin >> n){
        vector<string> v(n);
        rep(i,n) cin >> v[i];
        sort(all(v), [&](string const& a, string const& b){
                map<char,int> ord_suite {
                    {'D',1},{'C',2},{'H',3},{'S',4}
                };
                map<char,int> ord_rank;
                for(int i=2;i<=9;i++) ord_rank[i+'0'] = i;
                ord_rank['A'] = 1;
                ord_rank['T'] = 10;
                ord_rank['J'] = 11;
                ord_rank['Q'] = 12;
                ord_rank['K'] = 13;
                return a[0] != b[0]
                    ? ord_suite[a[0]] < ord_suite[b[0]]
                                        : ord_rank[a[1]] < ord_rank[b[1]];
            });
        rep(i,n){
            cout << v[i] << (i+1==n ? "\n" : " ");
        }
    }
}