#include <bits/stdc++.h>
using namespace std;
const int N = 105;
const long long MAX = 1e9 + 7;
int vis[N], f = 0;
vector<int> v[N];
void dfs(int s, int t) {
  if (s == t) {
    f = 1;
  }
  vis[s] = 1;
  for (auto it : v[s]) {
    if (!vis[it]) dfs(it, t);
  }
}
int main() {
  int n;
  cin >> n;
  int a[n], d[n];
  for (auto &z : a) cin >> z;
  for (auto &z : d) cin >> z;
  for (int i = 1; i <= n; i++) {
    if (i + d[i - 1] <= n) {
      v[i].push_back(i + d[i - 1]);
      v[i + d[i - 1]].push_back(i);
    }
    if (i - d[i - 1] >= 0) {
      v[i].push_back(i - d[i - 1]);
      v[i - d[i - 1]].push_back(i);
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= n; j++) vis[j] = 0;
    f = 0;
    dfs(i, a[i - 1]);
    if (f == 0) {
      cout << "NO\n";
      return 0;
    }
  }
  cout << "YES\n";
  return 0;
}
