output_description: If we can repeat the operation zero or more times so that the sequences a and
  b become equal, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 .. a_N
      b_1 b_2 .. b_N
attempt: N = int(input())
  A = input()
  ai = A.split()
  B = input()
  bi = B.split()
  i = 0
  a = []
  b = []
  for i in range(N):
      a.append(int(ai[i]))
      b.append(int(bi[i]))
  
  i = 0
  asum = 0
  bsum = 0
  for i in range(N):
      asum += a[i]
      bsum += b[i]
  
  c = True
  j = 0
  if asum > bsum:
      print("No")
      c = False
  elif asum == bsum:
      for j in range(N):
          if a[j] != b[j]:
              print("No")
              c = False
              break
      if c:
          print("Yes")
          c = False
  else:
      k = 0
      Da = 0
      Db = 0
      d = bsum - asum 
      while Da < d and Db < d:
          if a[k] < b[k]:
              Da += (b[k] - a[k]) // 2
              a[k] += ((b[k] - a[k]) // 2) * 2 
          elif a[k] == b[k]:
              k += 1
          else:
              Db += a[k] - b[k]
              b[k] += a[k] - b[k]
          if k == N:
              break
  if c:
      for j in range(N):
          if a[j] != b[j]:
              print("No")
              c = False
              break
      if c:
          if (N - Da) * 2 == (N - Db) * 1:
              print("Yes")
          else:
              print("No")N = int(input())
  A = input()
  ai = A.split()
  B = input()
  bi = B.split()
  i = 0
  a = []
  b = []
  for i in range(N):
      a.append(int(ai[i]))
      b.append(int(bi[i]))
  
  i = 0
  asum = 0
  bsum = 0
  for i in range(N):
      asum += a[i]
      bsum += b[i]
  
  c = True
  j = 0
  if asum > bsum:
      print("No")
      c = False
  elif asum == bsum:
      for j in range(N):
          if a[j] != b[j]:
              print("No")
              c = False
              break
      if c:
          print("Yes")
          c = False
  else:
      k = 0
      Da = 0
      Db = 0
      d = bsum - asum 
      while Da < d and Db < d:
          if a[k] < b[k]:
              Da += (b[k] - a[k]) // 2
              a[k] += ((b[k] - a[k]) // 2) * 2 
          elif a[k] == b[k]:
              k += 1
          else:
              Db += a[k] - b[k]
              b[k] += a[k] - b[k]
          if k == N:
              break
  if c:
      for j in range(N):
          if a[j] != b[j]:
              print("No")
              c = False
              break
      if c:
          if (N - Da) * 2 == (N - Db) * 1:
              print("Yes")
          else:
              print("No")
problem_description: Statement
  
  You are given two integer sequences of length N: a_1,a_2,..,a_N and
  b_1,b_2,..,b_N. Determine if we can repeat the following operation zero or
  more times so that the sequences a and b become equal.
  
  Operation: Choose two integers i and j (possibly the same) between 1 and N
  (inclusive), then perform the following two actions **simultaneously** :
  
    * Add 2 to a_i.
    * Add 1 to b_j.
samples: [{"input": "3\n    1 2 3\n    5 2 2", "output": "Yes\n    \n\nFor example, we can perform three operations as follows to do our job:\n\n  * First operation: i=1 and j=2. Now we have a = \\\\{3,2,3\\\\}, b = \\\\{5,3,2\\\\}.\n  * Second operation: i=1 and j=2. Now we have a = \\\\{5,2,3\\\\}, b = \\\\{5,4,2\\\\}.\n  * Third operation: i=2 and j=3. Now we have a = \\\\{5,4,3\\\\}, b = \\\\{5,4,3\\\\}.\n\n* * *"}, {"input": "5\n    3 1 4 1 5\n    2 7 1 8 2", "output": "No\n    \n\n* * *"}, {"input": "5\n    2 7 1 8 2\n    3 1 4 1 5", "output": "No"}]