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: n = int(input())
  count = 0
  lst = []
  while count < n:
      value = input().split()
      for i in value:
          if i.isdecimal():
              lst.append(int(i))
              continue
          lst.append(i)
      count += 1
  S_lst = []
  H_lst = []
  C_lst = []
  D_lst = []
  for s in range(2 * n):
      if lst[s] == "S":
          S_lst.append(lst[s])
          S_lst.append(lst[s + 1])
  for h in range(2 * n):
      if lst[h] == "H":
          H_lst.append(lst[h])
          H_lst.append(lst[h + 1])
  for c in range(2 * n):
      if lst[c] == "C":
          C_lst.append(lst[c])
          C_lst.append(lst[c + 1])
  for d in range(2 * n):
      if lst[d] == "D":
          D_lst.append(lst[d])
          D_lst.append(lst[d + 1])
  if 1 not in S_lst:
      print("S", 1)
  if 2 not in S_lst:
      print("S", 2)
  if 3 not in S_lst:
      print("S", 3)
  if 4 not in S_lst:
      print("S", 4)
  if 5 not in S_lst:
      print("S", 5)
  if 6 not in S_lst:
      print("S", 6)
  if 7 not in S_lst:
      print("S", 7)
  if 8 not in S_lst:
      print("S", 8)
  if 9 not in S_lst:
      print("S", 9)
  if 10 not in S_lst:
      print("S", 10)
  if 11 not in S_lst:
      print("S", 11)
  if 12 not in S_lst:
      print("S", 12)
  if 13 not in S_lst:
      print("S", 13)
  if 1 not in H_lst:
      print("H", 1)
  if 2 not in H_lst:
      print("H", 2)
  if 3 not in H_lst:
      print("H", 3)
  if 4 not in H_lst:
      print("H", 4)
  if 5 not in H_lst:
      print("H", 5)
  if 6 not in H_lst:
      print("H", 6)
  if 7 not in H_lst:
      print("H", 7)
  if 8 not in H_lst:
      print("H", 8)
  if 9 not in H_lst:
      print("H", 9)
  if 10 not in H_lst:
      print("H", 10)
  if 11 not in H_lst:
      print("H", 11)
  if 12 not in H_lst:
      print("H", 12)
  if 13 not in H_lst:
      print("H", 13)
  if 1 not in C_lst:
      print("C", 1)
  if 2 not in C_lst:
      print("C", 2)
  if 3 not in C_lst:
      print("C", 3)
  if 4 not in C_lst:
      print("C", 4)
  if 5 not in C_lst:
      print("C", 5)
  if 6 not in C_lst:
      print("C", 6)
  if 7 not in C_lst:
      print("C", 7)
  if 8 not in C_lst:
      print("C", 8)
  if 9 not in C_lst:
      print("C", 9)
  if 10 not in C_lst:
      print("C", 10)
  if 11 not in C_lst:
      print("C", 11)
  if 12 not in C_lst:
      print("C", 12)
  if 13 not in C_lst:
      print("C", 13)
  if 1 not in D_lst:
      print("D", 1)
  if 2 not in D_lst:
      print("D", 2)
  if 3 not in D_lst:
      print("D", 3)
  if 4 not in D_lst:
      print("D", 4)
  if 5 not in D_lst:
      print("D", 5)
  if 6 not in D_lst:
      print("D", 6)
  if 7 not in D_lst:
      print("D", 7)
  if 8 not in D_lst:
      print("D", 8)
  if 9 not in D_lst:
      print("D", 9)
  if 10 not in D_lst:
      print("D", 10)
  if 11 not in D_lst:
      print("D", 11)
  if 12 not in D_lst:
      print("D", 12)
  if 13 not in D_lst:
      print("D", 13)
  
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"}]