output_description: 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.
input_description: 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.
attempt: # 11-Array-Finding_Missing_Cards.py
  
  # ????¶???????????????????????????????
  # ???????????±?????¨?????????????????????????????????????????¨????????¨?????????52?????????????????????????????? n ????????????????????????????????????????????????
  # ???????????? n ????????????????????\?????¨??????????¶??????????????????????????????????????????°?????????????????????????????????
  # ???????????????????????£?????????????????????????????§??????????????????52?????????????????§??????
  
  # 52???????????????????????????????????????????????????????????????????????????????????????????????????????????????
  # ???????????????13??????????????????????????????
  
  # Input
  # ?????????????????????????????£??????????????????????????° n (n ??? 52)????????????????????????
  # ?¶??????? n ????????????????????????????????????????????????????????????
  # ??????????????????????????§???????????????????????¨??´??°??§??????
  # ????????????????????????????????¨?????????????????????'S'???????????????'H'???????????????'C'???????????????'D'??§??¨?????????????????????
  # ??´??°??????????????????????????????(1 ??? 13)?????¨??????????????????
  
  # Output
  # ?¶??????????????????????????????????1??????????????????????????????
  # ?????????????????\?????¨????§?????????????????????§???????????????????????¨??´??°??§??????
  # ???????????????????????????????????\????????¨????????¨????????????
  
  # ????????????????????????????????????????????????????????????????????§???????????????????????????
  # ?????????????????´??????????????????????°????????????????????????????
  # 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
  
  pair = []
  no_cards = []
  
  hand = int(input())
  
  for i in range(hand):
      pair.append(input().split())
  
  # ????????§????¶??????????????????????????????????????????????????????????
  for i in ["S", "H", "C", "D"]:
      for j in range(13):
          if [i, str(j + 1)] not in pair:
              no_cards.append([i, str(j + 1)])
  
  for i in range(len(no_cards)):
      print("{0} {1}".format(no_cards[i][0], no_cards[i][1]))
  
problem_description: 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.
samples: [{"input": "S 10\n    S 11\n    S 12\n    S 13\n    H 1\n    H 2\n    S 6\n    S 7\n    S 8\n    S 9\n    H 6\n    H 8\n    H 9\n    H 10\n    H 11\n    H 4\n    H 5\n    S 2\n    S 3\n    S 4\n    S 5\n    H 12\n    H 13\n    C 1\n    C 2\n    D 1\n    D 2\n    D 3\n    D 4\n    D 5\n    D 6\n    D 7\n    C 3\n    C 4\n    C 5\n    C 6\n    C 7\n    C 8\n    C 9\n    C 10\n    C 11\n    C 13\n    D 9\n    D 10\n    D 11\n    D 12\n    D 13", "output": "S 1\n    H 3\n    H 7\n    C 12\n    D 8"}]