#include <bits/stdc++.h>
using namespace std;
int arr[110], arr1[110], vis[110], n, adj[110][110] = {0};
bool dfs(int node, int a) {
  if (arr[node] == a) return true;
  vis[node] = true;
  int i;
  for (i = 1; i <= n; i++) {
    if (adj[node][i] == 1 && vis[i] == false) {
      if (dfs(i, a) == true) return true;
    }
  }
  return false;
}
int main() {
  int i, j;
  cin >> n;
  for (i = 1; i <= n; i++) cin >> arr[i];
  for (i = 1; i <= n; i++) {
    cin >> arr1[i];
    if (arr1[i] + i <= n) {
      adj[i][arr1[i] + i] = 1;
      adj[arr1[i] + i][i] = 1;
    }
    if (i - arr1[i] > 0) {
      adj[i][i - arr1[i]] = 1;
      adj[i - arr1[i]][i] = 1;
    }
  }
  for (i = 1; i <= n; i++) {
    for (j = 1; j <= n; j++) vis[j] = false;
    if (dfs(i, i) == false) {
      cout << "NO" << endl;
      break;
    }
  }
  if (i == n + 1) cout << "YES" << endl;
  return 0;
}
