import sys



sys.setrecursionlimit(10 ** 8)



input = sys.stdin.readline





def ceil(x, y):

    return -(-x // y)





def main():

    N = int(eval(input()))

    A = [int(x) for x in input().split()]

    B = [int(x) for x in input().split()]



    sa = sum(B) - sum(A)



    x = 0

    y = 0

    for i in range(N):

        if A[i] == B[i]:

            continue

        elif A[i] > B[i]:

            x += A[i] - B[i]

        else:

            y += ceil(B[i] - A[i], 2)



    if x <= sa and y <= sa:

        print("Yes")

    else:

        print("No")





if __name__ == '__main__':

    main()

import sys



sys.setrecursionlimit(10 ** 8)



input = sys.stdin.readline





def main():

    N = int(eval(input()))

    A = [int(x) for x in input().split()]

    B = [int(x) for x in input().split()]



    acnt = 0

    bcnt = 0



    for i in range(N):

        if A[i] == B[i]:

            continue

        elif A[i] > B[i]:

            bcnt += A[i] - B[i]

        else:

            acnt += -(-(B[i] - A[i]) // 2)

            bcnt += (B[i] - A[i]) % 2



    if acnt < bcnt:

        print("No")

    else:

        print("Yes")





if __name__ == '__main__':

    main()



import sys

sys.setrecursionlimit(10**8)
input = sys.stdin.readline


def ceil(x, y):
    return -(-x // y)


def main():
    N = int(eval(input()))
    A = [int(x) for x in input().split()]
    B = [int(x) for x in input().split()]
    sa = sum(B) - sum(A)
    x = 0
    y = 0
    for i in range(N):
        if A[i] == B[i]:
            continue
        elif A[i] > B[i]:
            x += A[i] - B[i]
        else:
            y += ceil(B[i] - A[i], 2)
    if x <= sa and y <= sa:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

import sys

sys.setrecursionlimit(10**8)
input = sys.stdin.readline


def main():
    N = int(eval(input()))
    A = [int(x) for x in input().split()]
    B = [int(x) for x in input().split()]
    acnt = 0
    bcnt = 0
    for i in range(N):
        if A[i] == B[i]:
            continue
        elif A[i] > B[i]:
            bcnt += A[i] - B[i]
        else:
            acnt += -(-(B[i] - A[i]) // 2)
            bcnt += (B[i] - A[i]) % 2
    if acnt < bcnt:
        print("No")
    else:
        print("Yes")


if __name__ == "__main__":
    main()

-def ceil(x, y): -    return -(-x // y) - - -    sa = sum(B) - sum(A) -    x = 0 -    y = 0 +    acnt = 0 +    bcnt = 0 -            x += A[i] - B[i] +            bcnt += A[i] - B[i] -            y += ceil(B[i] - A[i], 2) -    if x <= sa and y <= sa: +            acnt += -(-(B[i] - A[i]) // 2) +            bcnt += (B[i] - A[i]) % 2 +    if acnt < bcnt: +        print("No") +    else: -    else: -        print("No")