One day *n* cells of some array decided to play the following game. Initially each cell contains a number which is equal to it's ordinal number (starting from 1). Also each cell determined it's favourite number. On it's move *i*-th cell can exchange it's value with the value of some other *j*-th cell, if |*i* - *j*| = *d*<sub class="lower-index">*i*</sub>, where *d*<sub class="lower-index">*i*</sub> is a favourite number of *i*-th cell. Cells make moves in any order, the number of moves is unlimited.

The favourite number of each cell will be given to you. You will also be given a permutation of numbers from 1 to *n*. You are to determine whether the game could move to this state.
The first line contains positive integer *n* (1 ≤ *n* ≤ 100) — the number of cells in the array. The second line contains *n* distinct integers from 1 to *n* — permutation. The last line contains *n* integers from 1 to *n* — favourite numbers of the cells.
n = int(input())
per = list(map(int,input().split()))
d = [0] + list(map(int,input().split()))
p = [i for i in range(n+1)]
def find(node):
    while p[node] != node:
        p[node] = p[p[node]]
        node = p[node]
    return node

def union(n1,n2):
    p1 = find(n1)
    p2 = find(n2)

    if p1 != p2:
        p[p1] = p2

for i in range(1,n+1):
    if i-d[i] > 0 and i - d[i] <= n:
        union(i,i-d[i])
    if i + d[i] > 0 and i + d[i] <= n:
        union(i,i+d[i])
for i in range(n):
    pa = find(per[i])
    pa1 = find(i+1)
    if pa != pa1: print("NO");break
else:
    print("YES")