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())
data = list(map(int, input().split()))
spans = list(map(int, input().split()))

connect = [[False for c in range(n)] for r in range(n)]
for p, span in enumerate(spans):
  for r in [p-span, p+span]:
    if r >= 0 and r < n:
      connect[p][r] = connect[r][p] = True

def visit(data, connect, seen, group, i):
  if not seen[i]:
    seen[i] = True
    group.append((i, data[i]))
    for j in range(n):
      if connect[i][j]:
        visit(data, connect, seen, group, j)

seen = [False for i in range(n)]
for i in range(n):
  group = []
  visit(data, connect, seen, group, i)
  group.sort()
  #print()
  #print(group)
  values = sorted([value for (index, value) in group])
  #print(values)
  for i, value in enumerate(values):
    data[group[i][0]] = value
  #print(data)

if data == list(range(1, n+1)):
  print('YES')
else:
  print('NO')
