Problem: Kostya is a progamer specializing in the discipline of Dota 2. Valve Corporation, the developer of this game, has recently released a new patch which turned the balance of the game upside down. Kostya, as the captain of the team, realizes that the greatest responsibility lies on him, so he wants to resort to the analysis of innovations patch from the mathematical point of view to choose the best heroes for his team in every game.

A Dota 2 match involves two teams, each of them must choose some heroes that the players of the team are going to play for, and it is forbidden to choose the same hero several times, even in different teams. In large electronic sports competitions where Kostya's team is going to participate, the matches are held in the Captains Mode. In this mode the captains select the heroes by making one of two possible actions in a certain, predetermined order: pick or ban.

  * To pick a hero for the team. After the captain picks, the picked hero goes to his team (later one of a team members will play it) and can no longer be selected by any of the teams. 
  * To ban a hero. After the ban the hero is not sent to any of the teams, but it still can no longer be selected by any of the teams. 



The team captain may miss a pick or a ban. If he misses a pick, a random hero is added to his team from those that were available at that moment, and if he misses a ban, no hero is banned, as if there was no ban.

Kostya has already identified the strength of all the heroes based on the new patch fixes. Of course, Kostya knows the order of picks and bans. The strength of a team is the sum of the strengths of the team's heroes and both teams that participate in the match seek to maximize the difference in strengths in their favor. Help Kostya determine what team, the first one or the second one, has advantage in the match, and how large the advantage is.

Input

The first line contains a single integer n (2 ≤ n ≤ 100) — the number of heroes in Dota 2.

The second line contains n integers s1, s2, ..., sn (1 ≤ si ≤ 106) — the strengths of all the heroes.

The third line contains a single integer m (2 ≤ m ≤ min(n, 20)) — the number of actions the captains of the team must perform.

Next m lines look like "action team", where action is the needed action: a pick (represented as a "p") or a ban (represented as a "b"), and team is the number of the team that needs to perform the action (number 1 or 2).

It is guaranteed that each team makes at least one pick. Besides, each team has the same number of picks and the same number of bans.

Output

Print a single integer — the difference between the strength of the first team and the strength of the second team if the captains of both teams will act optimally well.

Examples

Input

2
2 1
2
p 1
p 2


Output

1


Input

6
6 4 5 4 5 5
4
b 2
p 1
b 1
p 2


Output

0


Input

4
1 2 3 4
4
p 2
b 2
p 1
b 1


Output

-2

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int inf = 0x3f3f3f3f;
using namespace std;
int n;
int val[120];
int m;
bool cmp(int x, int y) { return x > y; }
int f[25][(1 << 20) + 25];
char s[25][5];
int d[25];
int sum;
int pre;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &val[i]);
  scanf("%d", &m);
  pre = -1;
  sum = 1 << m;
  sort(val + 1, val + n + 1, cmp);
  for (int i = 0; i <= m; i++)
    for (int j = 0; j < sum; j++) f[i][j] = -inf;
  f[m + 1][sum - 1] = 0;
  for (int i = 1; i <= m; i++) scanf("%s%d", s[i], &d[i]);
  for (int i = m; i >= 1; i--) {
    if (s[i][0] == 'p') {
      for (int j = 0; j < sum; j++) {
        for (int k = 0; k < m; k++) {
          if ((j & (1 << k)) == 0) {
            if (pre == -1 || pre == d[i])
              f[i][j] = max(f[i][j], f[i + 1][j | (1 << k)] + val[k + 1]);
            else
              f[i][j] = max(f[i][j], -f[i + 1][j | (1 << k)] + val[k + 1]);
          }
        }
      }
    } else {
      for (int j = 0; j <= sum; j++) {
        for (int k = 0; k < m; k++) {
          if ((j & (1 << k)) == 0) {
            if (pre == -1 || pre == d[i])
              f[i][j] = max(f[i][j], f[i + 1][j | (1 << k)]);
            else
              f[i][j] = max(f[i][j], -f[i + 1][j | (1 << k)]);
          }
        }
      }
    }
    pre = d[i];
  }
  if (pre == 1)
    printf("%d\n", f[1][0]);
  else
    printf("%d\n", -f[1][0]);
  return 0;
}