N = int(input())
D = list(map(int, input().split()))
W_ = list(map(int, input().split()))
    
for i in range(2 ** N):
    W = W_[:]
    
    for j in range(N):
        if (i >> j) & 1:
            if (j+D[j])%N == (j-D[j])%N:
                W[(j+D[j])%N] ^= 1
            else:
                W[(j+D[j])%N] ^= 1
                W[(j-D[j])%N] ^= 1
    
    if all([Wi == 1 for Wi in W]):
        print('Yes')
        break
else:
    print('No')