CF28B.pSort

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__i, where d__i 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.

某天，某个数组的 $n$ 个单元格决定玩一个游戏。初始时，每个单元格中存放的数等于其序号（从 $1$ 开始）。此外，每个单元格还确定了它最喜欢的数。在第 $i$ 个单元格进行操作时，它可以将其当前值与另一个第 $j$ 个单元格的值交换，当且仅当 $|i - j| = d_i$，其中 $d_i$ 是第 $i$ 个单元格最喜欢的数。单元格可以以任意顺序进行操作，操作次数不限。

你将获得每个单元格最喜欢的数。同时，你还会获得一个 $1$ 到 $n$ 的排列。你需要判断：游戏是否可能达到该状态？

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$（$1 \leq n \leq 100$）—— 数组中的单元格数量。
第二行包含 $n$ 个互不相同的、取值范围为 $1$ 到 $n$ 的整数——一个排列。
最后一行包含 $n$ 个取值范围为 $1$ 到 $n$ 的整数——各单元格的喜好数字。

If the given state is reachable in the described game, output YES, otherwise NO.

如果给定的状态在所述游戏中可达，则输出 YES，否则输出 NO。