#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<i64(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;




void testcase(){
    i64 N; cin >> N;
    vector<i64> A(N);
    rep(i,N) cin >> A[i];
    i64 nmin = 0, nmax = 0, nadd = 0;
    rep(i,N){
        string s; cin >> s;
        if(s == "add") nadd++;
        if(s == "min") nmin++;
        if(s == "max") nmax++;
    }
    sort(A.begin(), A.end());
    if(nmin == 0){
        i64 ans = 0;
        rep(i,nadd-1) ans += A[i];
        ans += A[N-1];
        cout << ans << "\n";
        return;
    }
    if(nmin == N){
        cout << "0\n";
        return;
    }
    if(nadd == 0){
        cout << A[nmax-1] << "\n";
        return;
    }
    i64 r = A[nadd + nmax];
    i64 q = A[nadd + nmax - 1];
    rep(i,nadd-1) q += A[i];
    chmin(r, q);
    cout << r << "\n";
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}