class UF_tree:
    def __init__(self, n):
        self.root = [-1] * (n + 1)
        self.rank = [0] * (n + 1)

    def find(self, x):
        if self.root[x] < 0:
            return x
        else:
            self.root[x] = self.find(self.root[x])
            return self.root[x]

    def isSame(self, x, y):
        return self.find(x) == self.find(y)

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        elif self.rank[x] < self.rank[y]:
            self.root[y] += self.root[x]
            self.root[x] = y
        else:
            self.root[x] += self.root[y]
            self.root[y] = x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1

    def size(self, x):
        return -self.root[self.find(x)]


N = int(input())
D = list(map(int, input().split()))
W = list(map(int, input().split()))
slf = [0] * N
uf = UF_tree(N)

for i, d in enumerate(D):
    x = (i + d) % N
    y = (i - d % N + N) % N
    if x == y:
        slf[x] = 1
    else:
        uf.unite(x, y)

leader = set(uf.find(i) for i in range(N))
group = {i: [] for i in leader}
for i in range(N):
    group[uf.find(i)].append(i)

ok = True
for g in group.values():
    cnt = sum(1 - W[i] for i in g)
    if cnt % 2 == 0:
        continue
    if sum(slf[i] for i in g):
        continue
    ok = False

if ok:
    print("Yes")
else:
    print("No")