#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long n) {
  if (a == 0) return 0;
  if (a == 1 || n == 0) return 1;
  if (n == 1) return a % 1000000007;
  long long t = power(a, n / 2);
  t = t * t % 1000000007;
  if (n & 1) return t * a % 1000000007;
  return t;
}
int popcount(long long a) {
  int c = 0;
  while (a) {
    c++;
    a -= a & -a;
  }
  return c;
}
void factorize(int a) {}
void update(int tree[], int idx, int val, int maxval) {
  for (; idx <= maxval; idx += idx & -idx) {
    tree[idx] += val;
  }
}
int read(int tree[], int idx) {
  long long sum = 0;
  for (; idx > 0; idx -= idx & -idx) {
    sum += tree[idx];
  }
  return sum;
}
struct node2 {
  int id, val;
  node2() {
    static int ctx = 1;
    id = ctx++;
  };
  node2(int a, int b = 0, int c = 0, int d = 0, int e = 0, int f = 0) {
    val = a;
  }
};
struct comp2 {
  bool operator()(int a, int b) { return b < a; }
};
bool cmp2(int a, int b) { return b < a; }
struct node {
  int id, val;
  node() {
    static int ctx = 1;
    id = ctx++;
  };
  node(int a, int b = 0, int c = 0, int d = 0, int e = 0, int f = 0) {
    val = a;
  }
};
struct comp {
  bool operator()(int a, int b) { return b < a; }
};
bool cmp(int a, int b) { return b < a; }
long long n, m, a[17], b, c[17], d, k, h, w, x, y, p, q, t, ans, res, ma, T,
    act = 0, pas = 1, cur, flag, now;
int dp[(1 << 16) + 9][2][295], mi, resource[2][17];
char s[17];
double e, f, z;
vector<int> v[1], vec;
set<int> sett;
map<int, int> mapp;
void print(int mask, int i, int col, int left2, int required[]) {}
void print2(int mask, int id, int left) {}
void input() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> s[i] >> resource[0][i] >> resource[1][i];
  for (int i = 0; i < n; i++) c[i] = (s[i] == 'B');
}
void init() {
  long long extra[2] = {0};
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < n; j++) {
      if (resource[i][j] > n) {
        extra[i] += resource[i][j] - n;
        resource[i][j] = n;
      }
    }
  ans += max(extra[0], extra[1]);
  memset(dp, 0x1f, sizeof(dp));
  for (int j = 0; j < min(abs(extra[0] - extra[1]) + 1, n * n + 5); j++)
    dp[0][extra[0] > extra[1]][j] = 0;
}
void solve() {
  init();
  int lim = 1 << n;
  for (int mask = 1; mask < lim; mask++) {
    int cards[2] = {0};
    for (int i = 0; i < n; i++)
      if (mask & (1 << i)) cards[c[i]]++;
    for (int i = 0; i < n; i++) {
      if (mask & (1 << i)) {
        int res[2] = {0};
        res[0] = max(0, resource[0][i] - cards[0] + (c[i] == 0));
        res[1] = max(0, resource[1][i] - cards[1] + (c[i] == 1));
        int mask2 = mask ^ (1 << i);
        for (int col = 0; col < 2; col++) {
          for (int left2 = 0; left2 < n * n + 5; left2++) {
            int req[2] = {0};
            req[col] = res[col] - left2;
            req[1 ^ col] = res[1 ^ col];
            dp[mask][req[0] > req[1]][abs(req[0] - req[1])] =
                min(dp[mask][req[0] > req[1]][abs(req[0] - req[1])],
                    dp[mask2][col][left2] + req[req[0] <= req[1]]);
          }
        }
      }
    }
  }
}
void output() {
  mi = INT_MAX;
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < n * n + 2; j++) {
      mi = min(mi, dp[(1 << n) - 1][i][j]);
    }
  cout << ans + mi + n;
}
int main() {
  input();
  solve();
  output();
  return 0;
}
