#include <bits/stdc++.h>
using namespace std;
int n, a;
vector<int> v;
vector<int> w;
int g[128][128];
int visited[128];
void dfs(int i) {
  visited[i] = 1;
  for (int j = 0; j < n; j++) {
    if (g[i][j] && !visited[j]) {
      dfs(j);
    }
  }
}
bool is_connected(int i, int j) {
  memset(visited, 0, sizeof(visited));
  dfs(i);
  return visited[j];
}
int main() {
  ios::sync_with_stdio(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a;
    v.push_back(a);
  }
  for (int i = 0; i < n; i++) {
    cin >> a;
    w.push_back(a);
  }
  for (int i = 0; i < n; i++) {
    int fav = w[i];
    int lo = i - fav;
    int hi = i + fav;
    if (lo >= 0 && lo < n) {
      g[i][lo] = 1;
      g[lo][i] = 1;
    }
    if (hi >= 0 && hi < n) {
      g[i][hi] = 1;
      g[hi][i] = 1;
    }
  }
  bool yes = true;
  for (int i = 0; i < n; i++) {
    if (!is_connected(i, v[i] - 1)) {
      yes = false;
      break;
    }
  }
  if (yes) {
    cout << "YES\n";
  } else {
    cout << "NO\n";
  }
  return 0;
}
