/* -*- coding: utf-8 -*-
 *
 * 267.cc: No.267 トランプソート - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 52;

const char MCS[] = {'D', 'C', 'H', 'S'};
const char NCS[] = {
  '0', 'A', '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K'
};

/* typedef */

struct Card {
  int m, n;
  Card() {}

  void set(string &s) {
    for (m = 0; MCS[m] != s[0]; m++);
    for (n = 0; NCS[n] != s[1]; n++);
  }

  bool operator<(const Card &c) const {
    return m < c.m || (m == c.m && n < c.n);
  }

  void print() { printf("%c%c", MCS[m], NCS[n]); }
};

/* global variables */

Card cs[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;

  for (int i = 0; i < n; i++) {
    string s;
    cin >> s;
    cs[i].set(s);
  }
  sort(cs, cs + n);

  for (int i = 0; i < n; i++) {
    if (i) putchar(' ');
    cs[i].print();
  }
  putchar('\n');

  return 0;
}