
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args)
	{
		Scanner stdIn = new Scanner(System.in);
		
		int n = stdIn.nextInt();
		
		boolean[] hantei = new boolean[52];
		Arrays.fill(hantei,false);
		
		String pattern;
		int number;
		
		for(int i=0;i<n;i++)
		{
			pattern = stdIn.next();
			number = stdIn.nextInt();
			
			if(pattern.equals("S"))
			{
				hantei[number-1] = true;
			}
			else if(pattern.equals("H"))
			{
				hantei[13+number-1] = true;
			}
			else if(pattern.equals("C"))
			{
				hantei[26+number-1] = true;
			}
			else
			{
				hantei[39+number-1] = true;
			}
			
		}
		
		for(int i=0;i<52;i++)
		{
			if(!hantei[i])
			{
				if(i<13)
				{
					System.out.println("S "+(i+1));
				}
				else if(i<26)
				{
					System.out.println("H "+(i-12));
				}
				else if(i<39)
				{
					System.out.println("C "+(i-25));
				}
				else
				{
					System.out.println("D "+(i-38));
				}
			}
		}
	}
}
/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