#include <bits/stdc++.h>
using namespace std;
int size[111], fav[111], perm[111], parent[111];
vector<int> v[111];
int fin(int n) {
  if (n == parent[n]) return n;
  parent[n] = fin(parent[n]);
  return parent[n];
}
int main() {
  int n, i;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> perm[i];
  for (i = 1; i <= n; i++) {
    cin >> fav[i];
    parent[i] = i;
    size[i] = 1;
  }
  for (i = 1; i <= n; i++) {
    if (i + fav[i] <= n) {
      int x = fin(i);
      int y = fin(i + fav[i]);
      if (x != y) {
        if (size[x] < size[y]) swap(x, y);
        parent[y] = x;
        size[x] += size[y];
      }
    }
    if (i - fav[i] >= 1) {
      int x = fin(i);
      int y = fin(i - fav[i]);
      if (x != y) {
        if (size[x] < size[y]) swap(x, y);
        parent[y] = x;
        size[x] += size[y];
      }
    }
  }
  for (i = 1; i <= n; i++) {
    v[fin(i)].push_back(i);
  }
  int flag = 0;
  for (i = 1; i <= n; i++) {
    if (!(binary_search(v[parent[i]].begin(), v[parent[i]].end(), perm[i]))) {
      flag = 1;
      break;
    }
  }
  if (flag == 1)
    cout << "NO" << endl;
  else
    cout << "YES" << endl;
  return 0;
}
