from collections import Counter,defaultdict,deque

import sys,heapq,bisect,math,itertools,string,queue

sys.setrecursionlimit(10**8)

mod = 10**9+7

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))

def inpl_str(): return list(sys.stdin.readline().split())

def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))



n = inp()

a = inpl()

b = inpl()

x = 0

y = 0

for i in range(n):

    if b[i] - a[i] > 0:

        x += (b[i] - a[i])//2

    else:

        y += a[i] - b[i]

if x >= y:

    print('Yes')

else:

    print('No')
from collections import Counter,defaultdict,deque

from heapq import heappop,heappush,heapify

import sys,bisect,math,itertools,fractions

sys.setrecursionlimit(10**8)

mod = 10**9+7

INF = float('inf')

def inp(): return int(sys.stdin.readline())

def inpl(): return list(map(int, sys.stdin.readline().split()))



n = inp()

a = inpl()

b = inpl()

res = 0

for i in range(n):

    if a[i] > b[i]:

        res += b[i] - a[i]

    elif b[i] - a[i]:

        res += (b[i] - a[i])//2

print(('Yes' if res >= 0 else 'No'))
from collections import Counter, defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue

sys.setrecursionlimit(10**8)
mod = 10**9 + 7


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


def inpl_str():
    return list(sys.stdin.readline().split())


def inpln(n):
    return list(int(sys.stdin.readline()) for i in range(n))


n = inp()
a = inpl()
b = inpl()
x = 0
y = 0
for i in range(n):
    if b[i] - a[i] > 0:
        x += (b[i] - a[i]) // 2
    else:
        y += a[i] - b[i]
if x >= y:
    print("Yes")
else:
    print("No")

from collections import Counter, defaultdict, deque
from heapq import heappop, heappush, heapify
import sys, bisect, math, itertools, fractions

sys.setrecursionlimit(10**8)
mod = 10**9 + 7
INF = float("inf")


def inp():
    return int(sys.stdin.readline())


def inpl():
    return list(map(int, sys.stdin.readline().split()))


n = inp()
a = inpl()
b = inpl()
res = 0
for i in range(n):
    if a[i] > b[i]:
        res += b[i] - a[i]
    elif b[i] - a[i]:
        res += (b[i] - a[i]) // 2
print(("Yes" if res >= 0 else "No"))

-import sys, heapq, bisect, math, itertools, string, queue +from heapq import heappop, heappush, heapify +import sys, bisect, math, itertools, fractions +INF = float("inf") -def inpl_str(): -    return list(sys.stdin.readline().split()) - - -def inpln(n): -    return list(int(sys.stdin.readline()) for i in range(n)) - - -x = 0 -y = 0 +res = 0 -    if b[i] - a[i] > 0: -        x += (b[i] - a[i]) // 2 -    else: -        y += a[i] - b[i] -if x >= y: -    print("Yes") -else: -    print("No") +    if a[i] > b[i]: +        res += b[i] - a[i] +    elif b[i] - a[i]: +        res += (b[i] - a[i]) // 2 +print(("Yes" if res >= 0 else "No"))