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.
arr_size = int( input())

arr_fin = input().split(" ")
arr_fin = map(int, arr_fin)

cell_fav = input().split(" ")
cell_fav = map(int, cell_fav)


graph = {}

# A este array le voy a aplicar DSU
arr_ini = [i for i in range(1,arr_size+1)]


for fav, i in zip(cell_fav, arr_ini):
	graph[i] = [i]
	if(i-fav > 0):
		graph[i].append(abs(fav-i))

	if(fav+i <= arr_size):
		graph[i].append(fav+i)
	

#print(graph)

dsu_arr = arr_ini[::]

for key in graph:
	min_node = [key]
	for node in graph[key]:
		min_node.append(dsu_arr[node-1])
	min_node = min(min_node)

	for node in graph[key]:
		dsu_arr[node-1] = min_node


#print(dsu_arr)

cont = 0
flag = True
for cell in arr_fin:
	if(dsu_arr[cell-1] != dsu_arr[cont]):
		print("NO")
		flag = False
		break
	cont += 1

if(flag):
	print("YES")