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: def create_card_set():
      card_types = ["S", "H", "C", "D"]
      cart_nums = [i + 1 for i in range(13)]
  
      card_set = set()
  
      for ct in card_types:
          for cn in cart_nums:
              card_set = card_set | {(ct, cn)}
  
      return card_set
  
  
  def read_card():
      n = int(input())
      init_card_set = set()
  
      for i in range(n):
          ct, cn_s = tuple(input().split())
          cn = int(cn_s)
          init_card_set = init_card_set | {(ct, cn)}
  
      return init_card_set
  
  
  def sort_card(left_card):
      # card typeをバケットソート
      spade_ls = []
      heart_ls = []
      club_ls = []
      diamond_ls = []
  
      for card in left_card:
          ct = card[0]
          if ct == "S":
              spade_ls.append(card)
          elif ct == "H":
              heart_ls.append(card)
          elif ct == "C":
              club_ls.append(card)
          elif ct == "D":
              diamond_ls.append(card)
  
      # カード毎の数字を昇順ソート
      spade_ls = sorted(spade_ls, key=lambda x: x[1])
      heart_ls = sorted(heart_ls, key=lambda x: x[1])
      club_ls = sorted(club_ls, key=lambda x: x[1])
      diamond_ls = sorted(diamond_ls, key=lambda x: x[1])
  
      return spade_ls + heart_ls + club_ls + diamond_ls
  
  
  def find_miss_card():
  
      init_card_set = read_card()
  
      all_card = create_card_set()
  
      left_card = all_card - init_card_set
  
      result = sort_card(left_card)
  
      for ct, cn in result:
          print(f"{ct} {cn}")
  
  
  find_miss_card()
  
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"}]