output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: a, b, c = list(map(int, input().split()))
  d, e, f = list(map(int, input().split()))
  g, h, k = list(map(int, input().split()))
  N = int(input())
  l = []
  for i in range(N):
      e = int(input())
      l.append(e)
  L1 = {a, d, g}
  L2 = {a, b, c}
  L3 = {a, e, k}
  L4 = {c, f, k}
  L5 = {g, h, k}
  L6 = {c, e, g}
  for i in range(N):
      for j in range(N):
          for k in range(N):
              s = set([l[i], l[j], l[k]])
              if (
                  (s == L1)
                  or (s == L2)
                  or (s == L3)
                  or (s == L4)
                  or (s == L5)
                  or (s == L6)
              ):
                  print("Yes")
                  exit(0)
  
  print("No")
  
problem_description: Statement
  
  Takahashi wants to print a document with N pages double-sided, where two pages
  of data can be printed on one sheet of paper.
  
  At least how many sheets of paper does he need?
samples: [{"input": "5", "output": "3\n    \n\nBy printing the 1-st, 2-nd pages on the 1-st sheet, 3-rd and 4-th pages on the\n2-nd sheet, and 5-th page on the 3-rd sheet, we can print all the data on 3\nsheets of paper.\n\n* * *"}, {"input": "2", "output": "1\n    \n\n* * *"}, {"input": "100", "output": "50"}]