#include<bits/stdc++.h>
#define MAX_N 100001
#define INF_INT 2147483647
#define INF_LL 9223372036854775807
#define REP(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
void init(int n);
int find(int n);
void unite(int x,int y);
bool same(int x, int y);
ll bpow(ll,ll,ll);
typedef vector<int> vec;
typedef vector<vec> mat;
mat mul(mat &A,mat &B);
mat pow(mat A,ll n);
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};


bool cmp_P(const P &a,const P &b){
  return a.second < b.second;
}
int main()
{
  ll N,tmp=0;
  string S[52];
  cin >> N;
  vector<ll> vec(N,0);
  REP(i,N)
    cin >> S[i];
  REP(i,N){
    tmp = 0;
    if(S[i][0] == 'D')tmp+=100;
    if(S[i][0] == 'C')tmp+=200;
    if(S[i][0] == 'H')tmp+=300;
    if(S[i][0] == 'S')tmp+=400;
    if(S[i][1] == 'A')tmp+=1;
    if(S[i][1] == 'T')tmp+=10;
    if(S[i][1] == 'J')tmp+=11;
    if(S[i][1] == 'Q')tmp+=12;
    if(S[i][1] == 'K')tmp+=13;
    if(S[i][1] <= '9' && S[i][1] >= '0')tmp+=S[i][1]-'0';
    vec[i] = tmp;
  }
  sort(vec.begin(),vec.end());
  REP(i,vec.size()){
    string T = "";
    switch(vec[i]/100){
    case 1:
      T += "D";
      break;
    case 2:
      T += "C";
      break;
    case 3:
      T += "H";
      break;
    case 4:
      T += "S";
      break;
    }
    switch(vec[i]%100){
    case 1:
      T += "A";
      break;
    case 10:
      T += "T";
      break;
    case 11:
      T += "J";
      break;
    case 12:
      T += "Q";
      break;
    case 13:
      T += "K";
      break;
    default:
      char d = '0'+ vec[i]%100;
      T += d;
      break;
    }
    cout << T << " ";
  }
  cout << endl;
  return 0;
}

int par[MAX_N];
int ranks[MAX_N];

//n要素で初期化
void init(int n){
  REP(i,n){
    par[i] = i;
    ranks[i] = 0;
  }

}

//木の根を求める
int find(int x){
  if(par[x] == x){
    return x;
  }else{
    return par[x] = find(par[x]);
  }
}

void unite(int x,int y){
  x = find(x);
  y = find(y);
  if(x == y) return ;
  if(ranks[x] < ranks[y]){
    par[x] = y;
  }else{
    par[y] = x;
    if(ranks[x] == ranks[y]) ranks[x]++;
  }
}

bool same(int x, int y){
  return find(x) == find(y);
}

ll bpow(ll a, ll n,ll mod){
  int i = 0;
  ll res=1;
  while(n){
    if(n & 1)
      res = (res*a) % mod;
    a = (a*a) % mod;
    n >>= 1;
  }
  return res;
}
const int MOD = 1000000007;
mat mul(mat &A, mat &B){
  mat C(A.size(),vec(B[0].size()));
    REP(i,A.size())REP(k,B.size())REP(j,B[0].size()){
    C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD;
  }
  return C;
}

mat pow(mat A,ll n)
{
  mat B(A.size(),vec(A.size()));
  REP(i,A.size()){
    B[i][i] = 1;
  }
  while(n > 0){
    if ( n & 1) B = mul(B,A);
    A = mul(A,A);
    n >>= 1;
  }
  return B;
}