import java.util.Scanner;

public class Main
{
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        
        boolean[][] cardHasFlag = new boolean[4][13];
        
        int n = sc.nextInt();
        
        for (int i = 0; i < n; i++) {
            String make = sc.next();
            int card = sc.nextInt();
            
            switch(make) {
                case "S" :
                    cardHasFlag[0][card-1] = true;
                    break;
                case "H" :
                    cardHasFlag[1][card-1] = true;
                    break;
                case "C" :
                    cardHasFlag[2][card-1] = true;
                    break;
                case "D" :
                    cardHasFlag[3][card-1] = true;
                    break;
            }
        }
        
        for (int i = 0; i < 4; i++) {
            for (int j = 0 ; j < 13; j++) {
                if (cardHasFlag[i][j] == false) {
                    switch (i) {
                        case 0 :
                            System.out.printf("S %d\n", j+1);
                            break;
                        case 1 :
                            System.out.printf("H %d\n", j+1);
                            break;
                        case 2 :
                            System.out.printf("C %d\n", j+1);
                            break;
                        case 3 :
                            System.out.printf("D %d\n", j+1);
                            break;
                    }
                }
            }
        }
    }
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz