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())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[[] for i in range(n)]
for i in range(n):
    if i-b[i]>=0:
        c[i].append(i-b[i])
        c[i-b[i]].append(i)
    if i+b[i]<n:
        c[i].append(i+b[i])
        c[i+b[i]].append(i)
v=[1]*n
def dfs(u):
    global v,c
    v[u]=0
    for i in c[u]:
        if v[i]:
            dfs(i)
for i in range(n):
    v=[1]*n
    dfs(a[i]-1)
    if v[i]:
        print('NO')
        break
else:
    print('YES')