#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:102400000,102400000")
long long mul(long long a, long long b) { return (a * b) % (1000000007); }
long long add(long long a, long long b) { return (a + b) % (1000000007); }
long long sub(long long a, long long b) {
  return ((a - b) % (1000000007) + (1000000007)) % (1000000007);
}
void upd(long long &a, long long b) {
  a = (a % (1000000007) + b % (1000000007)) % (1000000007);
}
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
char s[(210000)];
int n, a[(210000)];
int t[(210000)];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  scanf("%s", s + 1);
  t[0] = 0;
  for (int i = 1; i <= n; i++) t[i] = t[i - 1] + (s[i] == '1');
  for (int i = 1; i <= n; i++) {
    int t2 = i, t3 = a[i];
    if (t2 == t3) continue;
    if (t2 > t3) swap(t2, t3);
    int q = t[t3 - 1] - t[t2 - 1];
    if (q != t3 - t2) {
      puts("NO");
      exit(0);
    }
  }
  puts("YES");
  return 0;
}
