#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


# %%
N = int(readline())
D = list(map(int, readline().split()))
W = list(map(int, readline().split()))

# %%
graph = [[] for _ in range(N)]
free = set()
for i, x in enumerate(D):
    j = (i + x) % N
    k = (i - x) % N
    if j == k:
        free.add(j)
    graph[j].append(k)
    graph[k].append(j)


# %%
comp = [0] * N
n = 0
for v in range(N):
    if comp[v]:
        continue
    n += 1
    comp[v] = n
    stack = [v]
    while stack:
        v = stack.pop()
        for w in graph[v]:
            if comp[w]:
                continue
            comp[w] = n
            stack.append(w)

# %%
comp_ind = [[] for _ in range(max(comp) + 1)]
for i, x in enumerate(comp):
    comp_ind[x].append(i)


# %%
answer = 'Yes'
for ind in comp_ind:
    is_free = bool(set(ind) & free)
    if is_free:
        continue
    ura = sum(1 - W[i] for i in ind)
    if ura & 1:
        answer = 'No'
        break
print(answer)