#include <bits/stdc++.h>
using namespace std;
int target[110];
vector<int> v[110];
bool vis[110][110];
bool dfs(int st, int cur, int ed) {
  vis[st][cur] = 1;
  if (cur == ed) return 1;
  for (int i = 0; i < v[cur].size(); i++) {
    if (!vis[st][v[cur][i]]) {
      if (dfs(st, v[cur][i], ed)) return 1;
    }
  }
  return 0;
}
int main() {
  int n, i, j, d;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> target[i];
  for (i = 1; i <= n; i++) {
    v[i].push_back(i);
    cin >> d;
    if (i + d <= n) {
      v[i].push_back(i + d);
      v[i + d].push_back(i);
    }
    if (i - d >= 1) {
      v[i].push_back(i - d);
      v[i - d].push_back(i);
    }
  }
  int flag1 = 1;
  for (i = 1; i <= n; i++) {
    if (!dfs(i, i, target[i])) flag1 = 0;
  }
  if (flag1)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
