#include <iostream>
#include <set>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n; cin >> n;
    multiset<int> ti;
    vector<int> ve;
    for (int i = 0; i < n; ++i) {
        char c; int w; cin >> c >> w;
        if (c == 'T') ti.insert(w);
        else ve.push_back(w);
    }
    ve.push_back(1000);
    sort(ve.begin(), ve.end());
    double t = 0; double v = 1;
    double cnt = 1; double p = 0;
    for (int i = 0; i < n; ++i) {
        double time = t + (ve[i] - p) / v;
        while (ti.size() > 0 && *ti.begin() <= time) {
            p = p + v * (*ti.begin() - t); t = *ti.begin(); v = 1.0 / ++cnt;
            time = t + (ve[i] - p) / v;
            ti.erase(ti.begin());
        }
        t = time; v = 1.0 / ++cnt; p = ve[i];
    }
    cout << round(t);
    return 0;
}