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())
vt=[[] for i in range(n)]
p=input().split(' ')
d=input().split(' ')
for i in range(len(p)):
    p[i]=int(p[i])-1
for i in range(len(d)):
    d[i]=int(d[i])
    vt[i].append(d[i])
    vt[d[i]].append(i)
def r_able(x,y,fax):
    if x==y:
        return True
    for i in vt[x]:
        if i!=fax and r_able(i,y,x):
            return True
    return False
q='YES'
for i in range(n):
    if not r_able(i,p[i],-1):
        q='NO'
print(q)
