#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
string m="DCHS";
string mm="TJQK";
bool comp(string a,string b){
  int aa,bb;
  if(a[0]!=b[0]){
    REP(i,4){
      if(a[0]==m[i])aa=i;
      if(b[0]==m[i])bb=i;
    }
  }
  if('2'<=a[1]&&a[1]<='9')aa=(int)a[1]-'0';
  else{
    if(a[1]=='A')aa=1;
    REP(i,4)if(a[1]==mm[i])aa=i+10;
  }
  if('2'<=b[1]&&b[1]<='9')bb=(int)b[1]-'0';
  else{
    if(b[1]=='A')bb=1;
    REP(i,4)if(b[1]==mm[i])bb=i+10;
  }
  return aa<bb;
}
int main(){
  int n;
  cin>>n;
  vector<string> V(n);
  REP(i,n)cin>>V[i];
  sort(ALL(V),comp);
  REP(i,V.size()){
    cout<<V[i];
    if(i==V.size()-1)cout<<endl;
    else cout<<" ";
  }
}