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())

par = []

#vector en c++
a = [-1]*n
b = [-1]*n
#funcion encontrar par
def findpar(u):
    if par[u-1] == u:
        return u
    else:
        par[u-1]=findpar(par[u-1])
        return par[u-1]

def merge(v, u):
    par[findpar(u)] = findpar(v)
 
#contruccion arreglos
for i in range(n):
    par.append(i+1)

#p=orden, d=fav
orden = input().split(' ')
for i in range(n):
    orden[i]=int(orden[i])

fav = input().split(' ')
for i in range(n):
    fav[i]=int(fav[i])

for i in range(0,n):
    if (i+1 + fav[i] <= n): 
        merge(i+1, i+1 + fav[i])
    if (i+1 - fav[i] > 0): 
        merge(i+1, i+1 - fav[i])


for i in range(0,n):
    if a[findpar(i)] == -1:
        a[findpar(i)]=[i]
    else:
        a[findpar(i)].append(i)
    
    if b[findpar(i)] == -1:
        b[findpar(i)]=[i]
    else:
        b[findpar(i)].append(i)


flag=True
for i in range(0,n):
    if (isinstance(a[i],list)):
        a[i].sort()
        b[i].sort()
        for j in range(len(a[i])):
            if a[i][j]!= b[i][j]:
                flag = False
if flag: 
    print("YES")
else:
    print("NO") 
