import sys
input=lambda:sys.stdin.readline().rstrip()
class unionFind:
    def __init__(self,N):
        self.N=N
        self.parent=[-1 for i in range(N)]
        self.size=[1 for i in range(N)]
    def find(self,x):
        path=[x]
        while self.parent[path[-1]]!=-1:
            path.append(self.parent[path[-1]])
        for i in path[:-1]:
            self.parent[i]=path[-1]
        return path[-1]
    def unite(self,x,y):
        roots=sorted([self.find(x),self.find(y)],key=lambda _:self.parent[_])
        if roots[0]!=roots[1]:
            self.parent[roots[0]]=roots[1]
            self.size[roots[1]]+=self.size[roots[0]]
N=int(input())
D=list(map(int,input().split()))
W=list(map(int,input().split()))
check=[0 for i in range(N)]
U=unionFind(N)
ans="Yes"
mem={}
for i in range(N):
	U.unite((i+D[i])%N,(i-D[i])%N)
	if 2*D[i]%N==0:
		check[i]=1
for i in range(N):
	h=U.find(i)
	if not h in mem:
		mem[h]=[0,0]
	mem[h][0]^=(W[i]==0)
	mem[h][1]|=check[i]
for i in mem:
	if mem[i][0] and mem[i][1]==0:
		ans="No"
print(ans)