#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long int ll;
using namespace std;
const int mod=1e9+7;

int N;
char p,q,suit[]="DCHS",num[]="A23456789TJQK";
bool card[99][99];
char m,n;
int main(){
    cin>>N;
    REP(i,0,N){
        cin>>m>>n;
        card[m][n]=true;
    }
    REP(i,0,4){
        REP(j,0,13){
            if(card[suit[i]][num[j]]){
                printf("%c%c ",suit[i], num[j]);
            }
        }
    }
    printf("\n");
    return 0;
}