N = int(input())
D = list(map(int, input().split()))
W = list(map(int, input().split()))

E = [set() for _ in range(N)]
for i in range(N):
    d = D[i]
    d = min(d % N, N - d % N)
    a = (i - d) % N
    b = (i + d) % N
    E[a].add(b)
    E[b].add(a)

D = [0] * N
Q = []
for i in range(N):
    D[i] =len(E[i])
    if D[i] == 0 and W[i] == 0:
        print("No")
        exit()
    if D[i] == 1:
        Q.append(i)

while Q:
    x = Q.pop()
    for y in E[x]:
        if x == y:
            W[x] = 1
            continue
        a = W[x] ^ 1
        W[x] = 1
        W[y] ^= a
        E[y].remove(x)
        D[y] -= 1
        if D[y] == 1:
            Q.append(y)

from atcoder.dsu import DSU
dsu = DSU(N)
for x in range(N):
    for y in E[i]:
        dsu.merge(x,y)

for G in dsu.groups():
    cnt = 0
    for g in G:
        if W[g] == 0:
            cnt += 1
    if cnt % 2 == 1:
        print("No")
        exit()

print("Yes")