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; R = sys.stdin.readline
S = lambda: map(int,R().split())
from collections import deque

n = int(R())
a = [0]+[*S()]
b = [*S()]
e = [[] for _ in range(n+1)]
for i,x in enumerate(b,1):
    if i+x<=n: e[i] += i+x,; e[i+x] += i,
    if 1<=i-x: e[i] += i-x,; e[i-x] += i,

vv = [0]*(n+1)
for i in range(1,n+1):
    if not vv[i]:
        vv[i] = 1
        c,d = [i],[a[i]]
        q = deque([i])
        while q:
            u = q.popleft()
            for v in e[u]:
                if not vv[v]:
                    vv[v] = 1
                    c += v,; d += a[v],; q += v,
        if sorted(c)!=sorted(d): print("NO"); exit()
print("YES")