#include <iostream>
#include <iomanip>//小数点出力用
//cout << fixed << setprecision(10) << ans;
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using ll = long long;
using namespace std;
#define modPHash (ll)((1LL<<61)-1)
#define modP (ll)998244353
bool chkrng0idx(int pos, int sup) { return (0 <= pos && pos < sup); }
int clk4(int num) { return (num - 2) * (num % 2); }
void yn(bool tf) { cout << (tf ? "Yes\n" : "No\n"); }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    vector<ll>A(N);
    for (int i = 0;i < N;i++) {
        cin >> A[i];
    }
    sort(A.begin(), A.end());
    int addC = 0;
    int maxC = 0;
    int minC = 0;
    for (int i = 0;i < N;i++) {
        string tmp;
        cin >> tmp;
        switch (tmp[1])
        {
        case 'd'://add
            addC++;
            break;
        case 'a'://max
            maxC++;
            break;
        case 'i'://min
            minC++;
            break;
        }
    }

    ll X = 0;
    if (addC + maxC >= 1) {


        X = A[addC + maxC - 1];
        A[addC + maxC - 1] = A[N - 1];
        if (addC != 0) {
            addC--;
        }
        else {
            maxC--;
        }
        N -= 1;
    }
    for (int i = 0;i < N;i++) {
        if (addC != 0) {
            X += A[i];
            addC--;
        }
        else if (maxC != 0) {
            X = max(X, A[i]);
            maxC--;
        }
        else {
            X = min(X, A[i]);
        }
    }
    cout << X;
    return 0;
}