#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr;	} cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
#define PI 3.14159265358979323846
#define EPS 1e-6
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define all(x) (x).begin(), (x).end()



typedef pair<int, int> pii;

int yuki0267()
{
	int N;
	cin >> N;

	string S = "DCHS", R = "0A23456789TJQK";
	
	map<char, int> suit, rank;
	map<int, char> revsuit, revrank;
	for (int i = 0; i < S.size(); i++) {
		suit[S[i]] = i;
		revsuit[i] = S[i];
	}
	for (int i = 1; i < R.size(); i++) {
		rank[R[i]] = i;
		revrank[i] = R[i];
	}
	
	string tmp;
	priority_queue< pii, vector<pii>, greater<pii> > pq;
	for (int i = 0; i < N; i++) {
		cin >> tmp;
		pq.push( pii( suit[tmp[0]], rank[tmp[1]] ) );
	}

	pii t = pq.top();
	cout << revsuit[t.first] << revrank[t.second];
	pq.pop();
	while (!pq.empty()) {
		pii t = pq.top();
		cout << " " << revsuit[t.first] << revrank[t.second];
		pq.pop();
	}
	cout << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0267();
	
	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}