#include <bits/stdc++.h>

#define mp       make_pair
#define mt	 make_tuple
#define pb       push_back
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    pair<int,int>      pii;
typedef    pair<long,long>    pll;

const int INF=1<<29;
const double EPS=1e-9;
const int MOD = 100000007;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};
int N;
vector<pair<int, int>> card;
char mark[4] = {'D', 'C', 'H', 'S'};
map<char, int> digits;
map<int, char> dicdigits;
int main(){
  cin >> N;
  digits['A'] = 1;
  digits['T'] = 10;
  digits['J'] = 11;
  digits['Q'] = 12;
  digits['K'] = 13;

  dicdigits[1] = 'A';
  dicdigits[10] = 'T';
  dicdigits[11] = 'J';
  dicdigits[12] = 'Q';
  dicdigits[13] = 'K';

  for (int i = 2; i <= 9; i++){
    digits[i + '0'] = i;
    dicdigits[i] = i + '0';
  }
  for (int i = 0; i < N; i++){
    string tmp;
    cin >> tmp;
    string t = tmp.substr(1).c_str();
    char c = t[0];
    int digit = digits[c];
    if (tmp[0] == 'D'){
      card.push_back(mp(0, digit));
    }
    if (tmp[0] == 'C'){
      card.push_back(mp(1, digit));
    }
    if (tmp[0] == 'H'){
      card.push_back(mp(2, digit));
    }
    if (tmp[0] == 'S'){
      card.push_back(mp(3, digit));
    }
  }
  sort(card.begin(), card.end());
  for (int i = 0; i < card.size(); i++){
    if (i != card.size() - 1){
      cout << mark[card[i].first] << dicdigits[card[i].second] << " ";
    }else{
      cout << mark[card[i].first] << dicdigits[card[i].second] << endl;
    }
  }
}