#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };
 
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int INF = INT_MAX / 10;

int main() {
	int N; cin >> N;
	vector<string> s(N);
	for (int i = 0; i < N; i++) {
		cin >> s[i];
		if (s[i][0] == 'D') s[i][0] = 'A';
		if (s[i][1] == 'A') s[i][1] = '1';
		if (s[i][1] == 'T') s[i][1] = 'a';
		if (s[i][1] == 'J') s[i][1] = 'b';
		if (s[i][1] == 'Q') s[i][1] = 'c';
		if (s[i][1] == 'K') s[i][1] = 'd';
	}
	sort(s.begin(), s.end());
	for (int i = 0; i < N; i++) {
		if (s[i][0] == 'A') s[i][0] = 'D';
		if (s[i][1] == '1') s[i][1] = 'A';
		if (s[i][1] == 'a') s[i][1] = 'T';
		if (s[i][1] == 'b') s[i][1] = 'J';
		if (s[i][1] == 'c') s[i][1] = 'Q';
		if (s[i][1] == 'd') s[i][1] = 'K';
		cout << s[i] << (i + 1 < N ? ' ' : '\n');
	}
}