#include <bits/stdc++.h>
using namespace std;
vector<int> a[111];
int x[111], n, y[111];
bool g[111][111];
bool dfs(int b, int u, int h) {
  g[b][u] = true;
  if (u == h) return true;
  int l = (int)a[u].size();
  int x;
  for (int i = 0; i < l; i++) {
    x = a[u][i];
    if (!g[b][x])
      if (dfs(b, x, h)) return true;
  }
  return false;
}
int main() {
  memset(g, 0, sizeof(g));
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x[i];
  }
  for (int i = 1; i <= n; i++) {
    cin >> y[i];
    if (i + y[i] <= n) {
      a[i].push_back(i + y[i]);
      a[i + y[i]].push_back(i);
    }
    if (i - y[i] >= 1) {
      a[i - y[i]].push_back(i);
      a[i].push_back(i - y[i]);
    }
  }
  bool f = true;
  for (int i = 1; i <= n; i++)
    if (!dfs(i, i, x[i])) {
      f = false;
      break;
    }
  if (f)
    cout << "YES";
  else
    cout << "NO";
  return 0;
}
