Problem:
Finding Missing Cards

Taro is going to play a card game. However, now he has only n cards, even though there should be 52 cards (he has no Jokers).

The 52 cards include 13 ranks of each of the four suits: spade, heart, club and diamond.

Input

In the first line, the number of cards n (n ≤ 52) is given.

In the following n lines, data of the n cards are given. Each card is given by a pair of a character and an integer which represent its suit and rank respectively. A suit is represented by 'S', 'H', 'C' and 'D' for spades, hearts, clubs and diamonds respectively. A rank is represented by an integer from 1 to 13.

Output

Print the missing cards. The same as the input format, each card should be printed with a character and an integer separated by a space character in a line.
Arrange the missing cards in the following priorities:

Print cards of spades, hearts, clubs and diamonds in this order.

If the suits are equal, print cards with lower ranks first.

Sample Input

47
S 10
S 11
S 12
S 13
H 1
H 2
S 6
S 7
S 8
S 9
H 6
H 8
H 9
H 10
H 11
H 4
H 5
S 2
S 3
S 4
S 5
H 12
H 13
C 1
C 2
D 1
D 2
D 3
D 4
D 5
D 6
D 7
C 3
C 4
C 5
C 6
C 7
C 8
C 9
C 10
C 11
C 13
D 9
D 10
D 11
D 12
D 13

Sample Output

S 1
H 3
H 7
C 12
D 8

Note

      解説

Solution in JAVA (judge verdict: Wrong Answer)


import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Main {

	/*
	 * ???52???
	 *
	 * ???????????????????????????????????????????????? ??????????????? ???n <= 52???
	 *
	 */
	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		// ?????±??\???
		String card = sc.next();
		int rank = Integer.parseInt(card);

		ArrayList<Integer> S_card = new ArrayList<Integer>(); // ????????????
		ArrayList<Integer> H_card = new ArrayList<Integer>(); // ?????????
		ArrayList<Integer> C_card = new ArrayList<Integer>(); // ?????????
		ArrayList<Integer> D_card = new ArrayList<Integer>(); // ?????????

		for (int i = 0; i < rank; i++) {
			// ??????
			String shape = sc.next();
			String no = sc.next();
			int choice = Integer.parseInt(no);
			if (shape.equals("S")) {
				S_card.add(choice);
			} else if (shape.equals("H")) {
				H_card.add(choice);
			} else if (shape.equals("C")) {
				C_card.add(choice);
			} else if (shape.equals("D")) {
				D_card.add(choice);
			}
		}

		// ??¢?´¢
		// ?¶???????????????????

		String[] cardShape = new String[] { "S", "H", "C", "D" };
		String swi = "";
		for (int i = 0; i < cardShape.length; i++) {
			swi = cardShape[i];
			if (swi == "S")
				swi_method(swi, S_card);
			else if(swi == "S")
				swi_method(swi, H_card);
			else if(swi == "S")
				swi_method(swi, C_card);
			else
				swi_method(swi, D_card);

		}

	}

	static void check(String cardShape, ArrayList<Integer> cArd_N) {
		Collections.sort(cArd_N);
		boolean[] chk_arr = new boolean[13];
		for (int i = 1; i < 13; i++) {
			for (int j = 0; j <= cArd_N.size(); j++) {
				if (i != j)
					chk_arr[i] = false;
				else
					chk_arr[i] = true;
			}
		}
		for (int j = 0; j < chk_arr.length; j++) {
			if (chk_arr[j] == false)
				System.out.println(cardShape + "" + (j + 1));
		}
	}

	static void swi_method(String swi, ArrayList<Integer> cArd_N) {
		switch (swi) {
		case "S":
			check(swi, cArd_N);
			break;
		case "H":
			check(swi, cArd_N);
			break;
		case "C":
			check(swi, cArd_N);
			break;
		case "D":
			check(swi, cArd_N);
			break;
		}
	}
}