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())
p = [int(i)-1 for i in input().split()]
c = [int(i) for i in input().split()]
parent = [i for i in range(n+3)]
size = [1 for i in range(n+3)]
def find(v):
    while(v!=parent[v]):
        parent[v]=parent[parent[v]]
        v = parent[v]
    return v
def union(v1,v2):
    v1= find(v1)
    v2 = find(v2)
    if v1==v2:
        return
    if size[v1]<size[v2]:
        parent[v1]=v2
        size[v2]+=size[v1]
    else:
        parent[v2]=v1
        size[v1]+=size[v2]  

for i in range(n):
    if i-c[i]>=0:
        union(i,i-c[i])
    if i+c[i]<n:
        union(i,i+c[i])
for i in range(n):
    if find(p[i])!=find(i):
        print('NO')
        exit(0)
print('YES')
        
