#include <iostream>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define REP(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define MP make_pair
#define PB push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

int main() {
	int n; cin >> n;
	vector<pair<int, string>> mn(n);
	REP(i, n)cin >> mn[i].second;
	REP(i, n) {
		char M = mn[i].second[0];
		char N = mn[i].second[1];

		int x,y;
		switch (M){
		case 'D':
			x = 100;
			break;
		case 'C':
			x = 200;
			break;
		case 'H':
			x = 300;
			break;
		case 'S':
			x = 400;
			break;
		}

		switch (N){
		case 'A':
			y = 1;
			break;
		case 'T':
			y = 10;
			break;
		case 'J':
			y = 11;
			break;
		case 'Q':
			y = 12;
			break;
		case 'K':
			y = 13;
			break;
		default:
			y = N - '0';
			break;
		}
		mn[i].first += x + y;
	}
	SORT(mn);
	REP(i, n) {
		cout << mn[i].second;
		printf(i == n - 1 ? "\n" : " ");
	}
}