#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
using namespace std;

map<int, int> m;

bool comp(const string& a, const string& b){
	if(m[a[0]] != m[b[0]]) return m[a[0]] < m[b[0]];
	return m[a[1]] < m[b[1]];
}

int main(){
	int n;
	cin >> n;
	vector<string> v(n);
	for(int i=0; i<n; i++){
		cin >> v[i];
	}

	m['D'] = 0;
	m['C'] = 1;
	m['H'] = 2;
	m['S'] = 3;

	m['A'] = 1;
	for(int i=2; i<10; i++){
		m[i+'0'] = i;
	}

	m['T'] = 10;
	m['J'] = 11;
	m['Q'] = 12;
	m['K'] = 13;

	sort(v.begin(), v.end(), comp);

	for(int i=0; i<n; i++){
		printf("%s%s", v[i].c_str(), (i==n-1?"\n":" "));
	}


	return 0;
}