Problem: One day, Hongcow goes to the store and sees a brand new deck of n special cards. Each individual card is either red or blue. He decides he wants to buy them immediately. To do this, he needs to play a game with the owner of the store.

This game takes some number of turns to complete. On a turn, Hongcow may do one of two things: 

  * Collect tokens. Hongcow collects 1 red token and 1 blue token by choosing this option (thus, 2 tokens in total per one operation). 
  * Buy a card. Hongcow chooses some card and spends tokens to purchase it as specified below. 



The i-th card requires ri red resources and bi blue resources. Suppose Hongcow currently has A red cards and B blue cards. Then, the i-th card will require Hongcow to spend max(ri - A, 0) red tokens, and max(bi - B, 0) blue tokens. Note, only tokens disappear, but the cards stay with Hongcow forever. Each card can be bought only once.

Given a description of the cards and their costs determine the minimum number of turns Hongcow needs to purchase all cards.

Input

The first line of input will contain a single integer n (1 ≤ n ≤ 16).

The next n lines of input will contain three tokens ci, ri and bi. ci will be 'R' or 'B', denoting the color of the card as red or blue. ri will be an integer denoting the amount of red resources required to obtain the card, and bi will be an integer denoting the amount of blue resources required to obtain the card (0 ≤ ri, bi ≤ 107).

Output

Output a single integer, denoting the minimum number of turns needed to acquire all the cards.

Examples

Input

3
R 0 1
B 1 0
R 1 1


Output

4


Input

3
R 3 0
R 2 0
R 1 0


Output

6

Note

For the first sample, Hongcow's four moves are as follows: 

  1. Collect tokens 
  2. Buy card 1
  3. Buy card 2
  4. Buy card 3

Note, at the fourth step, Hongcow is able to buy card 3 because Hongcow already has one red and one blue card, so we don't need to collect tokens.

For the second sample, one optimal strategy is as follows: 

  1. Collect tokens 
  2. Collect tokens 
  3. Buy card 2
  4. Collect tokens 
  5. Buy card 3
  6. Buy card 1

At the fifth step, even though Hongcow has a red token, Hongcow doesn't actually need to spend it, since Hongcow has a red card already.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int r[25], b[25], f[65545][125], R[65545], B[65545];
char c[25][2];
int main() {
  int i, j, k, Sta, sumr, sumb, ans, n;
  scanf("%d", &n);
  sumr = 0;
  sumb = 0;
  for (i = 1; i <= n; i++) {
    scanf("%s %d %d", c[i], &r[i], &b[i]);
    sumr += r[i];
    sumb += b[i];
  }
  Sta = (1 << n) - 1;
  for (i = 0; i <= Sta; i++) {
    for (j = 0; j < n; j++)
      if (((i >> j) & 1) == 1 && c[j + 1][0] == 'R') R[i]++;
  }
  for (i = 0; i <= Sta; i++) {
    for (j = 0; j < n; j++)
      if (((i >> j) & 1) == 1 && c[j + 1][0] == 'B') B[i]++;
  }
  for (i = 0; i <= Sta; i++) {
    for (j = 0; j <= 120; j++) f[i][j] = -1;
  }
  f[0][0] = 0;
  for (i = 0; i <= Sta; i++) {
    for (j = 0; j <= 120; j++) {
      if (f[i][j] == -1) continue;
      for (k = 0; k < n; k++) {
        if (((i >> k) & 1) == 0) {
          f[(i | (1 << k))][j + (r[k + 1] - max(r[k + 1] - R[i], 0))] =
              max(f[(i | (1 << k))][j + (r[k + 1] - max(r[k + 1] - R[i], 0))],
                  f[i][j] + (b[k + 1] - max(b[k + 1] - B[i], 0)));
        }
      }
    }
  }
  ans = 0x7fffffff;
  for (j = 0; j <= 120; j++)
    if (f[Sta][j] != -1) ans = min(ans, max(sumr - j, sumb - f[Sta][j]) + n);
  printf("%d", ans);
  return 0;
}