#include <atcoder/all>
#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace atcoder;
using namespace std;

typedef long long ll;

void solve() {
    int n;
    cin >> n;
    vector<ll> a(n);
    rep(i, 0, n) cin >> a[i];
    int mx = 0, mn = 0, ad = 0;
    rep(i, 0, n) {
        string s;
        cin >> s;
        mx += s == "max";
        mn += s == "min";
        ad += s == "add";
    }
    if (mx == n) {
        cout << a.back() << endl;
        return;
    }
    if (mn == n) {
        cout << 0 << endl;
        return;
    }
    if (ad == n) {
        cout << accumulate(a.begin(), a.end(), 0LL) << endl;
        return;
    }
    sort(a.begin(), a.end());
    ll init_max = a[ad + mx];
    while (mn) {
        a.pop_back();
        mn--;
    }
    n = a.size();
    a.insert(a.begin(), a.back());
    a.pop_back();
    reverse(a.begin(), a.end());
    ll ans = 0;
    while (ad) {
        ans += a.back();
        a.pop_back();
        ad--;
    }
    while (mx) {
        ans = max(ans, a.back());
        a.pop_back();
        mx--;
    }
    ans = min(ans, init_max);
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    while (t--) {
        solve();
    }
}