#include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n, f, perm[N];
struct DSU {
  int prnt[N];
  DSU() {
    for (int i = 0; i < N; i++) prnt[i] = i;
  }
  int root(int x) {
    if (prnt[x] == x) return x;
    return prnt[x] = root(prnt[x]);
  }
  void connect(int x, int y) {
    if (x <= 0 || y <= 0 || x >= N || y >= N) return;
    int r1 = root(x), r2 = root(y);
    if (r1 == r2) return;
    prnt[r2] = r1;
  }
  bool isConnect(int x, int y) { return root(x) == root(y); }
};
DSU d;
bool ok() {
  for (int i = 1; i <= n; ++i)
    if (!d.isConnect(i, perm[i])) return 0;
  return 1;
}
int main() {
  cin.sync_with_stdio();
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> perm[i];
  for (int i = 1; i <= n; i++) {
    cin >> f;
    d.connect(i, i - f);
    d.connect(i, i + f);
  }
  if (ok())
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
