#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const long long ooo = 9223372036854775807ll;
const int _cnt = 1000 * 1000 + 7;
const int _p = 1000 * 1000 * 1000 + 7;
const int N = 100005;
const double PI = acos(-1.0);
const double eps = 1e-9;
int o(int x) { return x % _p; }
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
void file_put() {
  freopen("filename.in", "r", stdin);
  freopen("filename.out", "w", stdout);
}
int n, a[N], s = 0, Lmax = 1e9, Lmin = -1e9, Rmax = 1e9, Rmin = -1e9;
char st[N];
int get_max(int x) {
  int ans = -oo;
  for (int i = (0); i <= (4); ++i) ans = max(ans, a[x - i]);
  return ans;
}
int get_min(int x) {
  int ans = oo;
  for (int i = (0); i <= (4); ++i) ans = min(ans, a[x - i]);
  return ans;
}
int main() {
  scanf("%d", &n);
  for (int i = (0); i <= (n - 1); ++i) scanf("%d", &a[i]);
  scanf("%s", st);
  for (int i = (0); i <= (n - 1); ++i) {
    if (s < 4) {
      s = (i && st[i] == st[i - 1]) * s + 1;
      continue;
    }
    int p = get_max(i), q = get_min(i);
    if (st[i] == st[i - 1]) {
      if (st[i] == '0') Lmax = min(Lmax, p);
      if (st[i] == '1') Rmin = max(Rmin, q);
    } else {
      s = 0;
      if (st[i] == '0') Rmax = min(Rmax, q - 1);
      if (st[i] == '1') Lmin = max(Lmin, p + 1);
    }
    s++;
  }
  printf("%d %d\n", Lmin, Rmax);
  return 0;
}
