#include <bits/stdc++.h>
using namespace std;
long long i, j, k, t, n, x, y, z, tt, c[323567], s, m, l, r;
long long a[1200001], b[234567], d[3345][3367], e[234567], f[234567];
vector<long long> p[123456], q, qq, bod;
void dfs(long long x) {
  if (c[x] > 0) return;
  c[x] = i;
  for (auto u : p[x]) dfs(u);
}
int main() {
  cin >> n;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (i = 1; i <= n; i++) {
    cin >> x;
    if (i + x <= n) {
      y = i + x;
      p[i].push_back(y);
      p[y].push_back(i);
    }
    if (i > x) {
      y = i - x;
      p[i].push_back(y);
      p[y].push_back(i);
    }
  }
  for (i = 1; i <= n; i++) {
    if (c[i] == 0) {
      dfs(i);
    }
  }
  for (i = 1; i <= n; i++)
    if (c[i] != c[a[i]]) {
      cout << "NO";
      return 0;
    }
  cout << "YES";
}
