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: Accepted)

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		// 出力用(カードの種類ごとに用意)
		StringBuilder output_s = new StringBuilder();
		StringBuilder output_h = new StringBuilder();
		StringBuilder output_c = new StringBuilder();
		StringBuilder output_d = new StringBuilder();
		// 種類ごとに全部の数字を配列で用意
		int[] spades = new int[13];
		int[] hearts = new int[13];
		int[] clubs = new int[13];
		int[] diamonds = new int[13];
		
		// 初期化
		for (int i = 0; i < 13; i++) {
			spades[i] = i + 1;
			hearts[i] = i + 1;
			clubs[i] = i + 1;
			diamonds[i] = i + 1;
		}
		
		int amount = scan.nextInt();
		String mark;
		int number;
		// 持っているカードのところを0で上書き
		for (int j = 0; j < amount; j++) {
			mark = scan.next();
			number = scan.nextInt();
			if ("S".equals(mark)) {
				spades[number - 1] = 0;
			}
			if ("H".equals(mark)) {
				hearts[number - 1] = 0;
			}
			if ("C".equals(mark)) {
				clubs[number - 1] = 0;
			}
			if ("D".equals(mark)) {
				diamonds[number - 1] = 0;
			}
		}
		
		// 0ではない要素(足りてないカード)を出力用のやつにくっつける
		for (int i = 0; i < 13; i++) {
			if (spades[i] != 0) {
				output_s.append("S" + " " + (i + 1)).append('\n');
			}
			if (hearts[i] != 0) {
				output_h.append("H" + " " + (i + 1)).append('\n');
			}
			if (clubs[i] != 0) {
				output_c.append("C" + " " + (i + 1)).append('\n');
			}
			if (diamonds[i] != 0) {
				output_d.append("D" + " " + (i + 1)).append('\n');
			}
		}
		
		// 出力
		System.out.print(output_s);
		System.out.print(output_h);
		System.out.print(output_c);
		System.out.print(output_d);
	}

}