#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a < b) return (gcd(b, a));
  if (b == 0) return a;
  return gcd(b, a % b);
}
map<int, list<int>> m;
vector<int> a(110);
int BFS(int i) {
  queue<int> q;
  q.push(i);
  map<int, int> m1;
  m1[i] = 1;
  int x;
  while (!q.empty()) {
    x = q.front();
    q.pop();
    if (x == a[i - 1]) {
      return (1);
    }
    for (auto y : m[x]) {
      if (m1.count(y) == 0) {
        m1[y] = 1;
        q.push(y);
      }
    }
  }
  return (-1);
}
int main() {
  int n, i, r;
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i];
  vector<int> b(n);
  for (i = 0; i < n; i++) {
    cin >> b[i];
    if ((i + 1 + b[i]) <= n) {
      m[i + 1].push_back(1 + i + b[i]);
      m[1 + i + b[i]].push_back(i + 1);
    }
    if ((i + 1 - b[i]) >= 1) {
      m[i + 1].push_back(i - b[i] + 1);
      m[i + 1 - b[i]].push_back(i + 1);
    }
  }
  for (i = 1; i <= n; i++) {
    r = BFS(i);
    if (r == -1) {
      cout << "NO";
      return (0);
    }
  }
  cout << "YES";
}
