class Unionfind:
 
    def __init__(self,n):
        self.uf = [-1]*n
 
    def find(self,x):
        if self.uf[x] < 0:
            return x
        else:
            self.uf[x] = self.find(self.uf[x])
            return self.uf[x]
 
    def same(self,x,y):
        return self.find(x) == self.find(y)
 
    def union(self,x,y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False
        if self.uf[x] > self.uf[y]:
            x,y = y,x
        self.uf[x] += self.uf[y]
        self.uf[y] = x
        return True
 
    def size(self,x):
        x = self.find(x)
        return -self.uf[x]


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

single = [0]*n
uf = Unionfind(n)
for i,d in enumerate(D):
    a = (i+d)%n
    b = (i-d)%n

    if a == b:
        single[a] = 1

    uf.union(a,b)


count = [0]*n
ok = [0]*n
for i,w in enumerate(W):
    if w == 0:
        count[uf.find(i)] += 1
    if single[i]:
        ok[uf.find(i)] = 1

for i in range(n):
    if uf.find(i) != i:
        continue
    if count[i] % 2 == 0 or ok[i]:
        continue
    print("No")
    exit()
print("Yes")