import sys
input = sys.stdin.readline

class Unionfind:
    def __init__(self, n):
        self.par = [-1] * n
        self.rank = [1] * n
    
    def root(self, x):
        if self.par[x] < 0:
            return x
            
        self.par[x] = self.root(self.par[x])
        
        return self.par[x]
    
    def unite(self, x, y):
        rx, ry = self.root(x), self.root(y)
        
        if rx != ry:
            if self.rank[rx] >= self.rank[ry]:
                self.par[rx] += self.par[ry]
                self.par[ry] = rx
                
                if self.rank[rx] == self.rank[ry]:
                    self.rank[rx] += 1
            else:
                self.par[ry] += self.par[rx]
                self.par[rx] = ry
    
    def is_same(self, x, y):
        return self.root(x) == self.root(y)
    
    def count(self, x):
        return -self.par[self.root(x)]

N = int(input())
D = list(map(int, input().split()))
W = list(map(int, input().split()))
uf = Unionfind(N)
s = []

for i in range(N):
    if (i+D[i])%N == (i-D[i])%N:
        s.append((i+D[i])%N)
        
    uf.unite((i+D[i])%N, (i-D[i])%N)

d = {i: [0, 0, 0] for i in range(N)}

for i in range(N):
    d[uf.root(i)][W[i]] += 1
    
    if i in s:
        d[uf.root(i)][2] += 1

for i in range(N):
    if d[i] == [0, 0, 0]:
        continue
    
    if d[i][2] == 0 and d[i][0] % 2 == 1:
        print('No')
        break
else:
    print('Yes')