#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VI a(n);
  rep(i, n) cin >> a[i];
  sort(all(a));
  int mx = 0, mn = 0, add = 0;
  rep(_, n) {
    string s;
    cin >> s;
    if (s == "max") mx++;
    else if (s == "min") mn++;
    else add++;
  }
  ll l = 0, r = accumulate(all(a), 0LL) + 1;
  while (r - l > 1) {
    ll c = (l + r) / 2;
    int p = 0;
    while (p < n && a[p] < c) p++;
    if (n - p < mn) {
      r = c;
      continue;
    }
    ll sm = 0;
    VI b;
    rep(i, n) {
      if (p <= i && i < p + mn) continue;
      b.emplace_back(a[i]);
    }
    if (add) {
      sm += b.back();
      rep(i, add - 1) sm += b[i];
    } else if (mx) {
      sm = b.back();
    }
    (sm >= c ? l : r) = c;
  }
  cout << l << '\n';
}