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.
if __name__ == '__main__':
    N = int(input())
    A = list(map(int, input().strip().split()))
    B = list(map(int, input().strip().split()))
    sousa_A, sousa_B = 0, 0
    if sum(A) > sum(B):
        print("No")
    elif all(a==b for a, b in zip(A, B)):
        print("Yes")
    for a, b in zip(A, B):
        if a > b:
            sousa_B += a-b
        if b > a:
            sousa_A += (b-a)//2
    if sousa_A == sousa_B:
        print("Yes")
    else:
        print("No")

n = int(input())
alist = list(map(int, input().split()))
blist = list(map(int, input().split()))

suma = sum(alist)
sumb = sum(blist)

ac, bc = 0, 0
for a, b in zip(alist, blist):
  if a < b:
    ac += (b - a) // 2 + (1 if (b - a) % 2 == 1 else 0)
  elif a > b:
    bc += a - b
if max(ac, bc) <= sumb - suma:
  print('Yes')
else:
  print('No')
