Takahashi found an integer sequence (A_1,A_2,...,A_N) with N terms. Since it was too heavy to carry, he decided to compress it into a single integer.

The compression takes place in N-1 steps, each of which shorten the length of the sequence by 1. Let S be a string describing the steps, and the sequence on which the i-th step is performed be (a_1,a_2,...,a_K), then the i-th step will be as follows:

* When the i-th character in S is `M`, let b_i = max(a_i,a_{i+1}) (1 ≦ i ≦ K-1), and replace the current sequence by (b_1,b_2,...,b_{K-1}).
* When the i-th character in S is `m`, let b_i = min(a_i,a_{i+1}) (1 ≦ i ≦ K-1), and replace the current sequence by (b_1,b_2,...,b_{K-1}).



Takahashi decided the steps S, but he is too tired to carry out the compression. On behalf of him, find the single integer obtained from the compression.

Constraints

* 2 ≦ N ≦ 10^5
* 1 ≦ A_i ≦ N
* S consists of N-1 characters.
* Each character in S is either `M` or `m`.

Input

The input is given from Standard Input in the following format:


N
A_1 A_2 … A_N
S


Output

Print the single integer obtained from the compression.

Examples

Input

4
1 2 3 4
MmM


Output

3


Input

5
3 4 2 2 1
MMmm


Output

2


Input

10
1 8 7 6 8 5 2 2 6 1
MmmmmMMMm


Output

5


Input

20
12 7 16 8 7 19 8 19 20 11 7 13 20 3 4 11 19 11 15 5
mMMmmmMMMMMMmMmmmMM


Output

11
/**
 *    author:  tourist
 *    created: 26.11.2019 17:52:04       
**/
#include <bits/stdc++.h>

using namespace std;

template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  string s;
  cin >> s;
  int low = 1, high = n;
  while (low < high) {
    int mid = (low + high + 1) >> 1;
    vector<int> b(n);
    for (int i = 0; i < n; i++) {
      b[i] = (a[i] >= mid);
    }
    vector<int> seq(1, 1);
    for (int i = 1; i < n; i++) {
      if (b[i] != b[i - 1]) {
        seq.push_back(1);
      } else {
        seq.back() += 1;
      }
    }
    seq[0] += n;
    seq.back() += n;
    int sz = (int) seq.size();
    vector<int> what(sz);
    for (int i = 0; i < sz; i++) {
      what[i] = (b[0] + i) % 2;
    }
    vector<set<pair<int, int>>> inner(2);
    vector<int> delta(2, 0);
    for (int i = 0; i < sz; i++) {
      inner[what[i]].emplace(seq[i], i);
    }
    vector<int> pr(sz);
    vector<int> ne(sz);
    for (int i = 0; i < sz; i++) {
      pr[i] = i - 1;
      ne[i] = i + 1;
    }
    auto Next = [&](int x) {
      return ne[x];
    };
    auto Prev = [&](int x) {
      return pr[x];
    };
    int head = 0;
    auto Remove = [&](int x) {
      if (x == head) {
        head = ne[head];
      }
      if (ne[x] < sz) {
        pr[ne[x]] = pr[x];
      }
      ne[pr[x]] = ne[x];
    };
    for (char c : s) {
      debug(mid, (string) "" + c, seq, delta, inner, ne);
      int u = (c == 'm' ? 0 : 1);
      delta[u] += 1;
      delta[u ^ 1] -= 1;
      while (!inner[u ^ 1].empty() && inner[u ^ 1].begin()->first + delta[u ^ 1] == 0) {
        int me = inner[u ^ 1].begin()->second;
        debug(me);
        inner[u ^ 1].erase(inner[u ^ 1].begin());
        inner[u].erase({seq[Prev(me)], Prev(me)});
        inner[u].erase({seq[Next(me)], Next(me)});
        seq[Prev(me)] += seq[Next(me)] + delta[u];
        inner[u].emplace(seq[Prev(me)], Prev(me));
        Remove(me);
        Remove(Next(me));
      }
      if (what[0] == u) {
        inner[u].erase({seq[0], 0});
        seq[0] -= 1;
        inner[u].emplace(seq[0], 0);
      }
    }
    vector<int> v;
    for (int i = 0; i < sz; i = ne[i]) {
      v.push_back(seq[i] + delta[what[i]]);
    }
    debug(v);
    int sum = accumulate(v.begin(), v.end(), 0);
//    assert(sum % 2 == 1);
    debug(mid, sum);
    int half = n + 1;
    int have = 0;
    int ptr = 0;
    int winner = -1;
    for (int i = 0; i < sz; i = ne[i]) {
      have += v[ptr++];
      if (have >= half) {
        winner = what[i];
        break;
      }
    }
    debug(seq, delta);
    debug("hi");
/*    int winner;
    if (Next(head) == sz) {
      winner = what[head];
    } else {
      if (Next(Next(head)) == sz) {
        winner = (seq[head] > seq[Next(head)] ? what[head] : what[Next(head)]);
      } else {
        winner = what[Next(head)];
      }
    }*/
    if (winner == 1) {
      low = mid;
    } else {
      high = mid - 1;
    }
  }
  cout << low << '\n';
  return 0;
}
