#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;

int main() {

  int ks[256];
  ks[(int)'T'] = 10;
  ks[(int)'J'] = 11;
  ks[(int)'Q'] = 12;
  ks[(int)'K'] = 13;
  ks[(int)'A'] = 1;
  char rks[15];
  rks[10] = 'T';
  rks[11] = 'J';
  rks[12] = 'Q';
  rks[13] = 'K';
  rks[1]  = 'A';  
  for(int i=2; i<=9; i++) ks[i+'0'] = i, rks[i] = i+'0';

  char rcs[15];
  rcs[0] = 'D';
  rcs[1] = 'C';
  rcs[2] = 'H';
  rcs[3] = 'S';

  int N; cin >> N;
  vector<pair<int, int>> ps(N);
  rep(i, N) {
    char c; char k; cin >> c >> k;
    if(c == 'D') c = 0;
    if(c == 'C') c = 1;
    if(c == 'H') c = 2;
    if(c == 'S') c = 3;

    ps[i].first   = c;
    ps[i].second  = ks[(int)k];
  }

  sort(ps.begin(), ps.end());

  rep(i, ps.size()) {
    if(i) cout << " ";
    cout << rcs[ps[i].first] << rks[ps[i].second];
  }
  cout << endl;

  return 0;
}