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())
orden= input().split()
fav= input().split()
arr=[]

for i in range(n):
    orden[i]=int(orden[i])
    fav[i]=int(fav[i])
    arr.append(i)

def union(el):
    if arr[el] != el: 
        arr[el] = union(arr[el])
    return arr[el]

cont=0
for i in fav:
    if cont >= i: 
        arr[union(cont)] = union(cont - i)
    if cont < n - i: 
        arr[union(cont)] = union(cont + i)
    cont += 1

flag = True
for i in range(n):
    if union(arr[i])==union(orden[i]-1):
        continue
    else:
        flag = False
        
if flag: 
    print("YES")
else:
    print("NO")