Missing Card -- Problem D (5 points)


A file contains 51 lines, giving 51 cards from a deck of cards. You must print out the missing card. Each card is represented as two characters, the first being the suit, one of H, C, D, S. and the second being the rank, one of A, K, Q, J, T, 9, 8, 7, 6, 5, 4, 3, 2. A full deck of cards contains 52 cards, represented by all the possible combinations of the four suits and 13 ranks.

Input will be from a file PROBLEMD.DAT which will have exactly 51 lines as described above.

Output, which must be written to standard output (the screen), must be the message "The missing card is XY", where X is the suit of the missing card and Y its rank.

Example Input

D2
D3
D4
D5
D7
H9
HT
HJ
DK
DA
H2
H3
H4
H5
H6
D8
D9
DT
DJ
DQ
H7
H8
HQ
ST
SJ
SQ
SK
SA
C2
C3
C4
HK
HA
S2
S3
S4
S5
S6
S7
S8
S9
C5
C6
C7
C8
C9
CT
CJ
CQ
CK
CA

Example Output

The missing card is D6