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())
from collections import defaultdict 
d=defaultdict(list)
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
for i in range(n):
    x=b[i]
    if i-x>=0:
        d[i].append(i-x)
        d[i-x].append(i)
    if i+x<n:
        d[i].append(i+x)
        d[i+x].append(i)
for i in range(n):
    d[i].append(i)
#print(d)
f=1 
for i in range(0,n):
    loc=0 
    q=[i]
    vis=[0]*n 
    vis[i]=1 
    while q:
        t=q.pop()
       # print(t)
        if a[t]==b[i]:
            loc=1 
        for i in d[t]:
            if not vis[i]:
                vis[i]=1 
                q.append(i)
    if loc==0:
        print(i)
        f=0 
if f:
    print('YES')
else:
    print('NO')