#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>

#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long
map<char,int> card;
map<char,int> p; 
class cmp{
	public: bool operator()(const string& a,const string& b){
		int sa=a[1]-'0';
		int sb=b[1]-'0';
		if(sa=='A'-'0') sa=1;
		if(sa=='T'-'0') sa=10;
		if(sa=='J'-'0') sa=11;
		if(sa=='Q'-'0') sa=12;
		if(sa=='K'-'0') sa=13;
		if(sb=='A'-'0') sb=1;
		if(sb=='T'-'0') sb=10;
		if(sb=='J'-'0') sb=11;
		if(sb=='Q'-'0') sb=12;
		if(sb=='K'-'0') sb=13;

		if(a[0]!=b[0]){
			return card[a[0]] < card[b[0]];
		}else{
			return sa<sb;
		}

	}
};

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;cin>>n;
	vector<string> s(n);
	REP(i,n) cin>>s[i];
	card['D']=1;
	card['C']=2;
	card['H']=3;
	card['S']=4;
	sort(s.begin(),s.end(),cmp());
	REP(i,n) cout<<s[i]<<" ";
	cout<<endl;
}