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

n = int(input())

S = []
H = []
C = []
D = []
Slist = []
Hlist = []
Clist = []
Dlist = []

for i in range(n):
    mark, number = map(str, input().split())
    
    if mark=='S':
        S.append(int(number))
    if mark=='H':
        H.append(int(number))
    if mark=='C':
        C.append(int(number))
    if mark=='D':
        D.append(int(number))

if S==[]:
    Slist.append(1,2,3,4,5,6,7,8,9,10,11,12,13)
if H==[]:
    Hlist.append(1,2,3,4,5,6,7,8,9,10,11,12,13)
if C==[]:
    Clist.append(1,2,3,4,5,6,7,8,9,10,11,12,13)
if D==[]:
    Dlist.append(1,2,3,4,5,6,7,8,9,10,11,12,13)

else:
    
    Slen = len(S)
    Hlen = len(H)
    Clen = len(C)
    Dlen = len(D)

    for i in range(Slen):
        for j in range(Slen-1,0,-1):
            if S[j-1]>S[j]:
                S[j-1],S[j] = S[j],S[j-1]

    for i in range(Hlen):
        for j in range(Hlen-1,0,-1):
            if H[j-1]>H[j]:
                H[j-1],H[j] = H[j],H[j-1]

    for i in range(Clen):
        for j in range(Clen-1,0,-1):
            if C[j-1]>C[j]:
                C[j-1],C[j] = C[j],C[j-1]

    for i in range(Dlen):
        for j in range(Dlen-1,0,-1):
            if D[j-1]>D[j]:
                D[j-1],D[j] = D[j],D[j-1]
    
    if S[Slen-1]<13:
        S.append(0)
    if H[Hlen-1]<13:
        H.append(0)
    if C[Clen-1]<13:
        C.append(0)
    if D[Dlen-1]<13:
        D.append(0)

    for i in range(13):
        if S[i]==i+1:
            pass
        else:
            S.insert(i,0)
            Slist.append(i+1)

    for i in range(13):
        if H[i]==i+1:
            pass
        else:
            H.insert(i,0)
            Hlist.append(i+1)

    for i in range(13):
        if C[i]==i+1:
            pass
        else:
            C.insert(i,0)
            Clist.append(i+1)

    for i in range(13):
        if D[i]==i+1:
            pass
        else:
            D.insert(i,0)
            Dlist.append(i+1)

if Slist==[]:
    print('',end='')
if Hlist==[]:
    print('',end='')
if Clist==[]:
    print('',end='')
if Dlist==[]:
    print('',end='')

else:
    Sll = len(Slist)
    Hll = len(Hlist)
    Cll = len(Clist)
    Dll = len(Dlist)

    for i in range(Sll):
        print('S',Slist[i])
    for i in range(Hll):
        print('H',Hlist[i])
    for i in range(Cll):
        print('C',Clist[i])
    for i in range(Dll):
        print('D',Dlist[i])