#include <bits/stdc++.h>
using namespace std;
const int maxn = 20;
const int maxs = (1 << 16) + 5;
const int maxm = 16 * 16 + 5;
int dp[maxs][2][maxm], a[maxn][2], b[maxs][2], c[maxn];
char ss[5];
int main() {
  int n, need0 = 0, need1 = 0;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%s%d%d", ss, &a[i][0], &a[i][1]);
    c[i] = *ss == 'B';
    need0 += max(0, a[i][0] - n);
    need1 += max(0, a[i][1] - n);
    a[i][0] = min(a[i][0], n);
    a[i][1] = min(a[i][1], n);
  }
  int tt = 1 << n;
  for (int s = 0; s < tt; ++s) {
    b[s][0] = b[s][1] = 0;
    for (int j = 0; j < n; ++j) {
      if (!(s >> j & 1)) continue;
      ++b[s][c[j]];
    }
  }
  memset(dp, 0x3f, sizeof(dp));
  if (need0 < need1)
    dp[0][0][min(need1 - need0, n * n)] = need1;
  else
    dp[0][1][min(need0 - need1, n * n)] = need0;
  for (int s = 0; s < tt; ++s) {
    for (int i = 0; i < n; ++i) {
      if (s >> i & 1) continue;
      int t = s | 1 << i;
      for (int k = 0; k < 2; ++k) {
        for (int j = 0; j <= n * n; ++j) {
          if (dp[s][k][j] == 0x3f3f3f3f) continue;
          int l = k ^ 1, cost1 = max(0, a[i][k] - b[s][k] - j),
              cost2 = max(0, a[i][l] - b[s][l]);
          if (cost1 > cost2)
            dp[t][l][cost1 - cost2] =
                min(dp[t][l][cost1 - cost2], dp[s][k][j] + 1 + cost1);
          else if (a[i][k] <= b[s][k])
            dp[t][k][min(n * n, j + cost2)] =
                min(dp[t][k][min(n * n, j + cost2)], dp[s][k][j] + 1 + cost2);
          else if (a[i][k] - b[s][k] <= j)
            dp[t][k][min(n * n, j - (a[i][k] - b[s][k]) + cost2)] =
                min(dp[t][k][min(n * n, j - (a[i][k] - b[s][k]) + cost2)],
                    dp[s][k][j] + 1 + cost2);
          else
            dp[t][k][cost2 - cost1] =
                min(dp[t][k][cost2 - cost1], dp[s][k][j] + 1 + cost2);
        }
      }
    }
  }
  printf("%d\n", min(*min_element(dp[tt - 1][0], dp[tt - 1][0] + n * n + 1),
                     *min_element(dp[tt - 1][1], dp[tt - 1][1] + n * n + 1)));
  return 0;
}
