#include <bits/stdc++.h>
using namespace std;

#define all(x) begin(x), end(x)
#ifdef CKISEKI
#define safe cerr << __PRETTY_FUNCTION__ << " line " << __LINE__ << " safe\n"
#define debug(a...) debug_(#a, a)
#define orange(a...) orange_(#a, a)
void debug_(const char *s, auto ...a) {
  cerr << "\e[1;32m(" << s << ") = (";
  int f = 0;
  (..., (cerr << (f++ ? ", " : "") << a));
  cerr << ")\e[0m\n";
}
void orange_(const char *s, auto L, auto R) {
  cerr << "\e[1;33m[ " << s << " ] = [ ";
  for (int f = 0; L != R; ++f)
    cerr << (f ? ", " : "") << *L++;
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define orange(...) safe
#define debug(...) safe
#endif

const int maxn = 200025;
int z[maxn];
void update(int p, int val) {
  debug(p, val);
  for (++p; p < maxn; p += p & -p)
    z[p] = max(z[p], val);
}
int query(int p) {
  debug(p);
  int r = 0;
  for (++p; p > 0; p -= p & -p)
    r = max(r, z[p]);
  return r;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int n;
  cin >> n;

  vector<map<int, array<int, 2>>> evt(n + 1);
  const auto add_point = [&](int x, int y, int type) {
    evt[x][y][type] += 1;
  };

  for (int i = 0; i < n; i++) {
    char c;
    int x, y;
    cin >> c >> x >> y;

    if (c == 'A') {
      if (x <= i) add_point(x, i - x, 1);
      if (y <= i) add_point(y, i - y, 0);
    } else {
      if (x <= i) add_point(i - x, x, 1);
      if (y <= i) add_point(i - y, y, 0);
    }
  }

  int ans = 0;
  vector<pair<int,int>> nxt;
  for (int i = 0; i <= n; i++) {
    for (auto [j, val] : nxt) {
      update(j, val);
    }
    nxt.clear();
    for (const auto &[j, val]: evt[i]) {
      int dp = query(j);
      ans = max(ans, dp + max(val[0], val[1]));

      update(j + 1, dp + val[0]);
      nxt.emplace_back(j, dp + val[1]);
      // at next i, update(j, dp + val[1]);
    }
  }

  cout << ans << '\n';

  return 0;
}