#include <algorithm>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

#include <queue>
#include <cstdio>
inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <iostream>
#include <set>

using namespace std;

int encode(const string &s){
  const char m = s[0];
  const char n = s[1];

  int ret = 0;

  if(m == 'D') ret += 0;
  if(m == 'C') ret += 1;
  if(m == 'H') ret += 2;
  if(m == 'S') ret += 3;
  ret *= 14;

  if(n == 'A') ret += 1;
  else if(n == 'T') ret += 10;
  else if(n == 'J') ret += 11;
  else if(n == 'Q') ret += 12;
  else if(n == 'K') ret += 13;
  else ret += n - '0';
  return ret;
}

int main(){
  const int n = getInt();
  vector<string> s(n);

  REP(i,n) cin >> s[i];

  sort(s.begin(), s.end(), [](const string &a, const string &b){
      return encode(a) < encode(b);
    });

  REP(i,n) cout << s[i] << " "; cout << endl;
  return 0;
}