#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) { 
        re(first); re(rest...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) { 
        pr(first); pr(rest...); 
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) { 
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) { 
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

template<class T> T invGeneral(T a, T b) {
    a %= b; if (a == 0) return b == 1 ? 0 : -1;
    T x = invGeneral(b,a); 
    return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}

template<class T> struct modular {
    T val; 
    explicit operator T() const { return val; }
    modular() { val = 0; }
    template<class U> modular(const U& v) {
        val = (-MOD <= v && v <= MOD) ? v : v % MOD;
        if (val < 0) val += MOD;
    }
    friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
    friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
    friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }

    modular operator-() const { return modular(-val); }
    modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
    modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
    modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
    friend modular exp(modular a, ll p) {
        modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans;
    }
    friend modular inv(const modular& a) { 
        auto i = invGeneral(a.val,MOD); assert(i != -1);
        return i;
    } // equivalent to return exp(b,MOD-2) if MOD is prime
    modular& operator/=(const modular& m) { return (*this) *= inv(m); }
    
    friend modular operator+(modular a, const modular& b) { return a += b; }
    friend modular operator-(modular a, const modular& b) { return a -= b; }
    friend modular operator*(modular a, const modular& b) { return a *= b; }
    
    friend modular operator/(modular a, const modular& b) { return a /= b; }
};

typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;

int N;
vi A, v;
string S;

set<pi> z[2], len[2];
int m, M;

void in(int a, pi b) {
    z[a].insert(b); len[a].insert({b.s-b.f+1,b.f});
}

void de(int a, pi b) {
    auto it = z[a].find(b); assert(it != z[a].end());
    z[a].erase(it); len[a].erase({b.s-b.f+1,b.f});
}

void join1(int b) {
    // [x.f-M, x.s-m] = [?,b-1]
    // [x.f-M, x.s-m] = [b,?]
    auto it = z[1].lb({b+M,-MOD}); assert(it->f == b+M);
    pi p = {prev(it)->f,it->s};
    de(1,*prev(it)); de(1,*it); in(1,p);
}

void rem0(int b) {
    pi p = *z[0].lb({b,-MOD});
    len[0].erase({p.s-p.f+1,p.f}); z[0].erase(p);
    join1(b-m);
}

void join0(int b) {
    // [x.f-m, x.s-M] = [?,b-1]
    auto it = z[0].lb({b+m,-MOD}); assert(it->f == b+m);
    pi p = {prev(it)->f,it->s};
    de(0,*prev(it)); de(0,*it); in(0,p);
    // [x.f-m, x.s-M] = [b,?]
}

void rem1(int b) {
    pi p = *z[1].lb({b,-MOD});
    len[1].erase({p.s-p.f+1,p.f}); z[1].erase(p);
    join0(b-M);
    // actually [b-M,b-M-1]
}

void process(char c) {
    // x in z[0] -> [x.f-m, x.s-M]
    // x in z[1] -> [x.f-M, x.s-m] 
    if (c == 'm') {
        m ++;
        while (sz(len[1]) && len[1].begin()->f+M-m == 0) rem1(len[1].begin()->s);
    } else {
        M ++;
        while (sz(len[0]) && len[0].begin()->f+m-M == 0) rem0(len[0].begin()->s);
    }
}

bool eval(vi t) {
    F0R(i,2) z[i].clear(), len[i].clear();
    m = M = 0;
    for (int i = 0; i < sz(t); ) {
        int I = i; while (i < sz(t) && t[i] == t[I]) i ++;
        pi o = {I,i-1};
        if (o.f == 0) o.f = -MOD;
        if (o.s == sz(t)-1) o.s = MOD;
        in(t[I],o);
    }
    trav(c,S) process(c);
    trav(o,z[0]) if (o.f-m <= 0 && 0 <= o.s-M) return 0;
    return 1;
}

int main() {
    setIO(); re(N); A.rsz(N); re(A,S);
    v = A; sort(all(v)); v.erase(unique(all(v)),v.end());
    int lo = 0, hi = sz(v)-1;
    while (lo < hi) {
        int mid = (lo+hi+1)/2;
        vi tmp;
        trav(t,A) tmp.pb(t >= v[mid]);
        if (eval(tmp)) lo = mid;
        else hi = mid-1;
    }
    // ps("HA",lo,v,eval({1,1,1,1,0}));
    ps(v[lo]);
}

/* stuff you should look for
    * int overflow, array bounds
    * special cases (n=1?), set tle
    * do smth instead of nothing and stay organized
*/

Measured memory_bytes: 6836