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

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    sort(a.begin(), a.end());
    long long ans = 0;
    int cnt[3] = {0};
    for (int i = 0; i < n; ++i)
    {
        string s;
        cin >> s;
        if (s == "add") ++cnt[0];
        else if (s == "max") ++cnt[1];
        else ++cnt[2];
    }
    if (cnt[0] <= 1)
    {
        int ans = 0;
        if (cnt[1] + cnt[0] == 0) ans = 0;
        else ans = a[cnt[1] + cnt[0] - 1];
        cout << ans << endl;
    }
    else if (cnt[0] == n)
    {
        long long ans = 0;
        for (int i = 0; i < n; ++i) ans += a[i];
        cout << ans << endl;
    }
    else
    {
        long long ans;
        if (cnt[1] > 0) ans = min(a[0] + a[cnt[0] + cnt[1] - 1], a[min(n - 1, n - cnt[2])]);
        else
        {
            ans = 0;
            for (int i = 0; i < cnt[0]; ++i) ans += a[i];
            ans = min(ans, (long long)a[n - cnt[2]]);
        }
        cout << ans << endl;
    }
}