N = int(eval(input()))

st = input().split()

a = [0 for i in range(N)]

A = 0

for i in range(N):

    a[i] = int(st[i])

    A += a[i]

st = input().split()

b = [0 for i in range(N)]

B = 0

for i in range(N):

    b[i] = int(st[i])

    B += b[i]

def cost(n):

    if n == 0:

        return [0, 0]

    elif n < 0:

        return [0, -n]

    elif n > 0 and n % 2 == 0:

        return [n//2, 0]

    else:

        return [(n+1)//2, 1]



K = B - A

PC = 0

MC = 0

for i in range(N):

    c = cost(b[i] - a[i])

    PC += c[0]

    MC += c[1]

if PC <= K and MC <= K and ((K-PC)*2 == (K-MC)):

    print("Yes")

else:

    print("No")

N = int(eval(input()))

a = [int(i) for i in input().split()]

A = sum(a)

b = [int(i) for i in input().split()]

B = sum(b)

def cost(n):

    if n == 0:

        return [0, 0]

    elif n < 0:

        return [0, -n]

    elif n > 0 and n % 2 == 0:

        return [n//2, 0]

    else:

        return [(n+1)//2, 1]



K = B - A

PC = 0

MC = 0

for i in range(N):

    c = cost(b[i] - a[i])

    PC += c[0]

    MC += c[1]

if PC <= K and MC <= K and ((K-PC)*2 == (K-MC)):

    print("Yes")

else:

    print("No")

N = int(eval(input()))
st = input().split()
a = [0 for i in range(N)]
A = 0
for i in range(N):
    a[i] = int(st[i])
    A += a[i]
st = input().split()
b = [0 for i in range(N)]
B = 0
for i in range(N):
    b[i] = int(st[i])
    B += b[i]


def cost(n):
    if n == 0:
        return [0, 0]
    elif n < 0:
        return [0, -n]
    elif n > 0 and n % 2 == 0:
        return [n // 2, 0]
    else:
        return [(n + 1) // 2, 1]


K = B - A
PC = 0
MC = 0
for i in range(N):
    c = cost(b[i] - a[i])
    PC += c[0]
    MC += c[1]
if PC <= K and MC <= K and ((K - PC) * 2 == (K - MC)):
    print("Yes")
else:
    print("No")

N = int(eval(input()))
a = [int(i) for i in input().split()]
A = sum(a)
b = [int(i) for i in input().split()]
B = sum(b)


def cost(n):
    if n == 0:
        return [0, 0]
    elif n < 0:
        return [0, -n]
    elif n > 0 and n % 2 == 0:
        return [n // 2, 0]
    else:
        return [(n + 1) // 2, 1]


K = B - A
PC = 0
MC = 0
for i in range(N):
    c = cost(b[i] - a[i])
    PC += c[0]
    MC += c[1]
if PC <= K and MC <= K and ((K - PC) * 2 == (K - MC)):
    print("Yes")
else:
    print("No")

-st = input().split() -a = [0 for i in range(N)] -A = 0 -for i in range(N): -    a[i] = int(st[i]) -    A += a[i] -st = input().split() -b = [0 for i in range(N)] -B = 0 -for i in range(N): -    b[i] = int(st[i]) -    B += b[i] +a = [int(i) for i in input().split()] +A = sum(a) +b = [int(i) for i in input().split()] +B = sum(b)