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 Ruby (judge verdict: Accepted)

def Suit2Num(s)
  return 0 if s == "S"
  return 1 if s == "H"
  return 2 if s == "C"
  return 3 if s == "D"
  nil
end
def Num2Suit(n)
  return "S" if n == 0
  return "H" if n == 1
  return "C" if n == 2
  return "D" if n == 3
  nil
end

s = Array.new(4)
4.times { |i| s[i] = Array.new(13) }

n = gets.to_i
n.times {
  cs,cn = gets.chomp.split(" ")
  s[Suit2Num(cs)][cn.to_i-1] = "Exist"
}

4.times { |i|
  13.times { |j|
    puts "#{Num2Suit(i)} #{j+1}" if s[i][j] != "Exist"
  }
}