#include <bits/stdc++.h>
using namespace std;
int pset[102];
void init() {
  for (int i = 1; i <= 100; i++) pset[i] = i;
}
int findset(int x) {
  if (x == pset[x])
    return x;
  else
    return pset[x] = findset(pset[x]);
}
bool sameset(int x, int y) { return findset(x) == findset(y); }
void unionset(int x, int y) { pset[findset(x)] = findset(y); }
int main() {
  int n;
  int a[102];
  int mp[102];
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> mp[i];
  }
  init();
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    int li = i - a[i];
    int ri = i + a[i];
    if (li > 0 && li <= n && !sameset(li, i)) unionset(li, i);
    if (ri > 0 && ri <= n && !sameset(ri, i)) unionset(i, ri);
  }
  for (int i = 1; i <= n; i++) {
    if (!sameset(i, mp[i])) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES";
}
