#include <bits/stdc++.h>
int n;
inline int read() {
  char ch = getchar();
  int u = 0, f = 1;
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    u = (u << 1) + (u << 3) + ch - 48;
    ch = getchar();
  }
  return u * f;
}
using namespace std;
const int maxn = 1e5 + 10;
char b[maxn];
int a[maxn];
long long r = 1e9, l = -1e9;
inline int Min(long long a, long long b) { return a < b ? a : b; }
inline int Max(long long a, long long b) { return a > b ? a : b; }
int main() {
  int n = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  scanf("%s", b + 1);
  int Zero = '0';
  for (int i = 5; i <= n; i++) {
    if (b[i] == '0') {
      b[i - 1] != '0' ? r = Min(Min(a[i], Min(Min(a[i - 1], a[i - 2]),
                                              Min(a[i - 3], a[i - 4]))) -
                                    1ll,
                                r)
                      : 0;
    } else {
      b[i - 1] != '1' ? l = Max(Max(a[i], Max(Max(a[i - 1], a[i - 2]),
                                              Max(a[i - 3], a[i - 4]))) +
                                    1ll,
                                l)
                      : 0;
    }
  }
  printf("%lld %lld", l, r);
  return 0;
}
