#include <bits/stdc++.h>
using namespace std;
string itos(int x) {
  stringstream ss;
  ss << x;
  return ss.str();
}
int dp[70000][2][300], n, t[20], res = 2147483647, needr, needb;
pair<int, int> cost[20];
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n; i++) {
    char c;
    int x, y;
    cin >> c >> cost[i].first >> cost[i].second;
    needr += max(0, cost[i].first - n);
    cost[i].first = min(cost[i].first, n);
    needb += max(0, cost[i].second - n);
    cost[i].second = min(cost[i].second, n);
    t[i] += (c == 'B');
  }
  for (int i = 0; i < 70000; i++)
    for (int j = 0; j < 2; j++)
      for (int k = 0; k < 300; k++) dp[i][j][k] = 1000000007;
  dp[0][0][0] = 0;
  int MAXN = (1 << n) - 1;
  for (int i = 0; i < MAXN; i++) {
    int colr, colb;
    colr = colb = 0;
    for (int j = 0; j < n; j++)
      if (i & (1 << j)) (t[j] ? colb : colr)++;
    for (int j = 0; j < 2; j++) {
      for (int k = 0; k < 300; k++) {
        if (dp[i][j][k] == 1000000007) continue;
        for (int l = 0; l < n; l++) {
          if (not(i & (1 << l))) {
            int rr, rb;
            (j ? rb : rr) = 0;
            (j ? rr : rb) = k;
            int cr = cost[l].first - colr;
            int cb = cost[l].second - colb;
            cr = max(0, cr);
            cb = max(0, cb);
            int wr = max(0, cr - rr);
            int wb = max(0, cb - rb);
            int req = max(wr, wb);
            int nxtr = rr + req - cr;
            int nxtb = rb + req - cb;
            int &nxt = dp[i | (1 << l)][nxtr ? 1 : 0][nxtr ? nxtr : nxtb];
            ++req;
            nxt = min(nxt, dp[i][j][k] + req);
          }
        }
      }
    }
  }
  for (int j = 0; j < 2; j++) {
    for (int k = 0; k < 300; k++) {
      if (dp[MAXN][j][k] == 1000000007) continue;
      int rr, rb;
      (j ? rb : rr) = 0;
      (j ? rr : rb) = k;
      int wr = max(0, needr - rr);
      int wb = max(0, needb - rb);
      int req = max(wr, wb);
      res = min(dp[MAXN][j][k] + req, res);
    }
  }
  cout << res << endl;
  return 0;
}
