#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
#include <stack>
#include <queue>
using namespace std;

//#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[4] = {0,-1,0,1};
const int Vecx[4] = {1,0,-1,0};

int data[52] = {0};
string data2[52];
	
	
//デフォルト昇順
void combsort(int max){
	bool flg;
	int h;
	
	h = max / 1.3;
	while(true){
		flg = true;
		
		for(int i=0; i+h<max; i++){
			if(data[i] > data[i+h]){		//ソート基準変更位置
				//swap
				swap(data[i], data[i+h]);
				swap(data2[i], data2[i+h]);
				
				flg = false;
			}
		}
		
		if(h <= 1){
			if(flg){
				break;
			}
		}else{
			h /= 1.3;
		}
	}
}


int main(){
	int n;
	string in;
	
	cin >> n;
	rep(i,n){
		cin >> in;
		data2[i] = in;
		if(in[0] == 'D'){
			data[i] = 0;
		}else if(in[0] == 'C'){
			data[i] = 100;
		}else if(in[0] == 'H'){
			data[i] = 200;
		}else{
			data[i] = 300;
		}
		
		if(in[1] == 'A'){
			data[i] += 1;
		}else if(in[1] == 'T'){
			data[i] += 10;
		}else if(in[1] == 'J'){
			data[i] += 11;
		}else if(in[1] == 'Q'){
			data[i] += 12;
		}else if(in[1] == 'K'){
			data[i] += 13;
		}else{
			data[i] += (in[1] - '0');
		}
	}
	
	combsort(n);
	
	rep(i,n){
		cout << data2[i] << " ";
	}
    
    return 0;
}