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 sys
input = sys.stdin.readline

n = int(input())
w = list(map(int, input().split()))
qq = list(map(int, input().split()))
d = [set() for i in range(n)]
for i, j in enumerate(qq):
    if i-j > -1:
        d[i-j].add(i)
        d[i].add(i-j)
    if i+j < n:
        d[i+j].add(i)
        d[i].add(i+j)
x = [0]*n
for i in range(n):
    if x[i] == 0:
        k = {i}
        q = [i]
        while q:
            a = q.pop()
            for j in d[a]:
                if x[j] == 0:
                    x[j] = 1
                    k.add(j)
                    q.append(j)
        a = [i+1 for i in k]
        if sorted(a) != sorted([w[i] for i in k]):
            print('NO')
            exit()
print('YES')
