#include<iostream>
using namespace std;
struct node
{
    int by, pr, t;
};
node a[100001];
bool v[100001];
int main()
{
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++)
    {
        cin >> a[i].by >> a[i].pr >> a[i].t;
    }
    int sum = 0;
    for(int i = 1; i <= n; i++)
    {
        sum += a[i].pr;
    }
    for(int i = 1; i <= n; i++)
    {
        if(a[i].by == 0) continue;
        for(int j = 1; j <= i; j++)
        {
            if(a[j].by == 1) continue;
            if(v[j] == true) continue;
            if(a[j].pr >= a[i].pr && a[i].t - a[j].t <= 45)
            {
                sum -= a[i].pr;
                v[j] = true;
                continue;
            }
        }
    }
    cout << sum << endl;
    return 0;
}