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.
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = sum([b[i]-a[i]for i in range(n)])
i = 0
while i<50:
    if bin(c+i).count("1")==i:
        print(i)
        print("Yes")
        break
    i += 1
else: print("No")
n = int(input())
a, b = [list(map(int, input().split())) for i in range(2)]

ap = bp = 0
for i in range(n):
        if a[i]>b[i]: bp += a[i]-b[i]
        else:
                if (b[i]-a[i])%2: bp += 1
                ap += (b[i]-a[i]+1)//2
print("YNeos"[ap<bp::2])