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.

Note

解説



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.

Example

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


Output

S 1
H 3
H 7
C 12
D 8
def find_card(mark,input,result):
    for i in xrange(13):
        if input[i] == 0:
            result.append(i)
    result.sort()
    for x in result:
        print mark + " " +  str(x+1)

n = input()
s = [0]*13
h = [0]*13
c = [0]*13
d = [0]*13
for i in xrange(n):
    m,n = map(str,raw_input().split())
    n = int(n)-1
    if m in "S" :
        s[n] = 1
    elif m in "H":
        h[n] = 1
    elif m in "C":
        c[n] = 1
    elif m in "D":
        d[n] = 1

res_s=[]
res_h=[]
res_c=[]
res_d=[]

find_card("S",s,res_s)
find_card("H",h,res_h)
find_card("C",c,res_c)
find_card("D",d,res_d)