#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(0);
  cin.sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  int a[n + 1];
  for (int i = 1; i <= n; i++) cin >> a[i];
  string bprime;
  cin >> bprime;
  bprime = "." + bprime;
  int bp[n + 1];
  for (int i = 1; i <= n; i++) bp[i] = bprime[i] - '0';
  int l = -1e9;
  int r = 1e9;
  int b[n + 1];
  for (int i = 1; i <= 4; i++) b[i] = 0;
  for (int i = 5; i <= n; i++) {
    if (false) cerr << "currently on index " << i << '\n';
    if (bp[i] != b[i - 1]) {
      if (bp[i] == 1 and b[i - 1] == 0) {
        if (false) cerr << "forcing switch to 1" << '\n';
        int ma = -INT_MIN;
        for (int j = 0; j <= 4; j++) {
          if (false) cerr << ("i - j") << " is " << (i - j) << '\n';
          if (false) cerr << ("a[i - j]") << " is " << (a[i - j]) << '\n';
          ma = max(ma, a[i - j]);
        }
        if (false) cerr << ("ma") << " is " << (ma) << '\n';
        l = max(l, ma + 1);
        if (false) cerr << ("l") << " is " << (l) << '\n';
      } else {
        if (false) cerr << "forcing switch to 0" << '\n';
        int mi = INT_MAX;
        for (int j = 0; j <= 4; j++) {
          mi = min(mi, a[i - j]);
        }
        r = min(r, mi - 1);
        if (false) cerr << ("r") << " is " << (r) << '\n';
      }
    }
    b[i] = bp[i];
  }
  cout << l << " " << r << '\n';
}
