#include <bits/stdc++.h>
int main() {
  int fav[101], n, flag[101], a[101], i, j, c, m, k;
  while (scanf("%d", &n) != EOF) {
    memset(flag, 0, sizeof(flag));
    c = 1;
    for (i = 0; i < n; i++) scanf("%d", &a[i]);
    for (i = 0; i < n; i++) scanf("%d", &fav[i]);
    for (i = 0; i < n - 1; i++)
      for (j = i + 1; j < n; j++)
        if (abs(i - j) == fav[i] || abs(i - j) == fav[j]) {
          if (flag[i] == 0 && flag[j] == 0) {
            flag[i] = c;
            flag[j] = c++;
          } else if (flag[i] + flag[j] != 0 && flag[i] * flag[j] == 0) {
            if (flag[i] == 0)
              flag[i] = flag[j];
            else
              flag[j] = flag[i];
          } else if (flag[i] * flag[j] != 0 && flag[i] != flag[j]) {
            m = flag[i];
            for (k = 0; k < n; k++)
              if (flag[k] == m) flag[k] = flag[j];
          }
        }
    for (i = 0; i < n; i++)
      if ((flag[i] == flag[a[i] - 1] && flag[i] != 0) ||
          (flag[a[i] - 1] == 0 && a[i] == i + 1))
        continue;
      else
        break;
    if (i == n)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
