output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: A = list(map(int, input().split()))
  B = list(map(int, input().split()))
  C = list(map(int, input().split()))
  x = [[0 for i in range(3)] for j in range(3)]
  N = int(input())
  if N >= 3:
      for i in range(N):
          b = int(input())
          for j in range(3):
              if A[j] == b:
                  x[0][j] = 1
              elif B[j] == b:
                  x[1][j] = 1
              elif C[j] == b:
                  x[2][j] = 1
      flag = 0
      if x[0][0] == 1:
          if x[0][1] == 1 and x[0][2] == 1:
              flag = 1
          elif x[1][0] == 1 and x[2][0] == 1:
              flag = 1
          elif x[1][1] == 1 and x[2][2] == 1:
              flag = 1
      if x[1][1] == 1:
          if x[0][1] == 1 and x[2][1] == 1:
              flag = 1
          elif x[1][0] == 1 and x[2][0] == 1:
              flag = 1
          elif x[0][2] == 1 and x[2][0] == 1:
              flag = 1
      if x[2][2] == 1:
          if x[2][0] == 1 and x[2][1] == 1:
              flag = 1
          elif x[0][2] == 1 and x[1][2] == 1:
              flag = 1
      if flag == 1:
          print("Yes")
      else:
          print("No")
      # print(x)
  else:
      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"}]