#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;
int main(){
    int i,n; cin >> n;
    vector<ll> a(n);
    for(i=0;i<n;i++) cin >> a[i];
    int ad = 0,mx = 0,mn = 0;
    for(i=0;i<n;i++){
        string s; cin >> s;
        if(s=="add") ad++;
        if(s=="max") mx++;
        if(s=="min") mn++;
    }
    sort(a.begin(),a.end());
    if(ad==0){
        if(mx==0) cout << 0 << "\n";
        else cout << a[mx - 1] << "\n";
    }else{
        ll x = a[mx + ad - 1];
        for(i=0;i<ad - 1;i++) x += a[i];
        if(mn>0) min(x,a[mx + ad]);
        cout << x << "\n";
    }
}