import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    def dfs(u):
        vis[u]=True
        res=ww[u]
        for v in to[u]:
            if vis[v]:continue
            res+=dfs(v)
        return res

    inf=10**4
    n=II()
    dd=LI()
    ww=LI()
    ww=[1-w for w in ww]
    to=defaultdict(list)
    for i,d in enumerate(dd):
        u=(i+d)%n
        v=(i-d)%n
        if u==v:ww[u]=inf
        else:
            to[u].append(v)
            to[v].append(u)
    vis=[False]*n
    for u in range(n):
        if vis[u]:continue
        ret=dfs(u)
        if ret%2 and ret<inf:
            print("No")
            exit()
    print("Yes")

main()