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.
import collections
n=int(input())
arr=[i+1 for i in range(n)]
tar=[int(i) for i in input().split()]
fav=[int(i) for i in input().split()]
par=[i for i in range(n)]

def find(x):
    if x!=par[x]:
        par[x]=find(par[x])
    return par[x]
    
def union(x,y):
    px,py=par[find(x)],par[find(y)]
    par[px]=py

for i in range(len(arr)):
    if i+fav[i]<n:union(i,i+fav[i])
    if i-fav[i]>=0:union(i,i-fav[i])

    
cnt=[collections.Counter() for i in range(n)]
for idx,i in enumerate(arr):
    cnt[find(idx)][i]+=1 
    
check=True
for idx,i in enumerate(tar):
    gr=find(idx)
    if not cnt[gr][i]:
        check=False
        break 
    cnt[gr][i]-=1 
print('YES' if check else 'NO')