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())
perm=list(map(int,input().split()))
fav=list(map(int,input().split()))
adj=[[] for i in range(n+1)]
for i in range(1,n+1):
    if (i-fav[i-1]) in range(1,n+1):
        adj[i].append(i-fav[i-1])
        adj[i-fav[i-1]].append(i)
    if (i+fav[i-1]) in range(1,n+1):
        adj[i].append(i+fav[i-1])
        adj[i+fav[i-1]].append(i)
for i in range(n):
    q=[perm[i]];vis=[True]*(n+1)
    vis[perm[i]]=False;flag=0
    if perm[i]==i+1:flag=1
    while len(q)!=0:
        r=q.pop()
        for j in adj[r]:
            if vis[j]:
                vis[j]=False
                q.append(j)
                if i+1==j:
                    flag=1;break
        if flag==1:break
    if flag==0:
        exit(print('NO'))
print('YES')