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.
# LUOGU_RID: 111130512
from sys import stdin 
input = stdin.readline 

def get() : 
    return map(int,input().split())

n = int(input()) 
lst = [0] + list(get()) 
f = [[0] * 110 for i in range(110)] 

for i in range(1, n + 1) : 
    f[i][i] = 1 

t = [0] + list(get()) 
for i in range(1, n + 1) : 
    j = t[i] 
    if i - j >= 1 : f[i][i - j] = 1 
    if i + j <= n : f[i][i + j] = 1 

for k in range(1, n + 1) : 
    for i in range(1, n + 1) : 
        for j in range(1, n + 1) : 
            f[i][j] |= (f[i][k] & f[j][k]) | (f[i][k] & f[k][j])

for i in range(1, n + 1) : 
    if not f[i][lst[i]] : 
        print('NO') 
        exit() 

print("YES")
