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())
b=list(map(int,input().split()))
c=list(map(int,input().split()))
d=[[] for i in range(n+1)]
for i in range(n):
    p=(i+1)-c[i]
    q=(i+1)+c[i]
    if p<=0 and q<=n:
        d[i+1].append(q)
        d[q].append(i+1)
    elif p > 0 and q > n:
        d[i + 1].append(p)
        d[p].append(i + 1)
    elif p>0 and q<=n:
        d[i + 1].append(p)
        d[p].append(i + 1)
        d[i + 1].append(q)
        d[q].append(i + 1)
v=[0]*(n+1)
j=1
k=0
while(j<=n):
    if v[j]!=1:
        f=[0]*(n+1)
        s=[j]
        r=[]
        while(s):
            m=s.pop()
            r.append(m)
            v[m]=1
            f[b[m-1]]=1

            for i in d[m]:
                if v[i]==0:
                    s.append(i)
        for p in r:
            if f[p]==0:
                k=1
                break
    if k==1:
        break

    j+=1
if k==0:
    print("YES")
else:
    print('NO')



