#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  map<char, int> suit, val;
  suit['D'] = 0; suit['C'] = 1; suit['H'] = 2; suit['S'] = 3;
  FOR(i, 2, 10) val['0' + i] = i;
  val['A'] = 1; val['T'] = 10; val['J'] = 11; val['Q'] = 12; val['K'] = 13;
  int n; cin >> n;
  vector<pair<pair<int, int>, string> > cards(n);
  REP(i, n) {
    string mn; cin >> mn;
    char m = mn[0], n = mn[1];
    cards[i] = {{suit[m], val[n]}, mn};
  }
  sort(ALL(cards));
  REP(i, n) cout << cards[i].second << " \n"[i + 1 == n];
  return 0;
}