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()))

tree = [[] for i in range(n)]
par = [0] * n

def crs (v):
    global par
    global tree
    par[v] = v
    tree[v].append(v)

def gts (v):
    global par
    if par[v] == v:
        return v
    par[v] = gts(par[v])
    return par[v]

def uns (u, v):
    global par
    global tree
    u = gts(u)
    v = gts(v)
    if u == v:
        return
    if tree[u] > tree[v]:
        u, v = v, u
    for elem in tree[u]:
        tree[v].append(elem)
    par[u] = v


for i in range(n):
    crs(i)

for i in range(n):
    if i + b[i] < n:
        uns(i, i + b[i])
    if i - b[i] >= 0:
        uns(i, i - b[i])

compl = True

for i in range(n):
    u = gts(a[i] - 1)
    if not(i in tree[u]):
        compl = False

if compl:
    print("YES")
else:
    print("NO")