#include <bits/stdc++.h>
using namespace std;
long long int const mod = 1e9 + 7;
const int maxn = 100002;
long long int par[102];
long long int find(long long int a) {
  if (par[a] != a) return par[a] = find(par[a]);
  return par[a];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int n;
  cin >> n;
  long long int p[n + 1], a[n + 1];
  for (int i = 1; i <= n; i++) cin >> p[i], par[i] = i;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) {
    long long int x = i + a[i], y = i - a[i];
    if (x >= 1 && x <= n) {
      long long int u = find(i), v = find(x);
      if (u != v) {
        par[u] = v;
      }
    }
    if (y >= 1 && y <= n) {
      long long int u = find(i), v = find(y);
      if (u != v) {
        par[u] = v;
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    long long int u = find(i), v = find(p[i]);
    if (u != v) {
      cout << "NO";
      return 0;
    }
  }
  cout << "YES";
}
