#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;


int main()
{
	int N;  cin >> N;
	vector<pls> v(N);

	for (int i = 0; i < N; i++) {
		string s;  cin >> s;
		v[i].second = s;
		if (s[0] == 'D') {
			v[i].first = 1;
		}
		else if (s[0] == 'C') {
			v[i].first = 100;
		}
		else if (s[0] == 'H') {
			v[i].first = 1000;
		}
		else if (s[0] == 'S') {
			v[i].first = 10000;
		}
		if (s[1] == 'A') {
			v[i].first += 1;
		}
		else if (s[1] == 'T') {
			v[i].first += 10;
		}
		else if (s[1] == 'J') {
			v[i].first += 11;
		}
		else if (s[1] == 'Q') {
			v[i].first += 12;
		}
		else if (s[1] == 'K') {
			v[i].first += 13;
		}
		else {
			v[i].first += s[1] - '0';
		}
	}

	sort(v.begin(),v.end());
	for (int i = 0; i < N; i++) {
		cout << v[i].second;
		if (i != N - 1)printf(" ");
	}
	cout << endl;
	return 0;
}