#include<bits/stdc++.h>
using namespace std;
//queue <int> q;
struct node {
	int p,t;
	bool b,car;
};
const int N=1e5+10;
node a[N];
int n,sum,c[N];
int main (){
//    freopen("apple1.in","r",stdin);
//    freopen("apple10.out","w",stdout);
    cin>>n;
    for (int i=1;i<=n;i++) {
    	a[i].b=0;
	}
    for (int i=1;i<=n;i++) {
    	cin>>a[i].car>>a[i].p>>a[i].t;
	}
	for (int i=1;i<=n;i++) {
		if (a[i].car==0) {
			sum+=a[i].p;
		}
		else {
			for (int j=1;j<=i;j++) {
				if (a[j].car==0) {
					if (a[j].b==0) {
						if (a[i].t-a[j].t>=45) {
						    if (a[j].p>=a[i].p) {
		                        a[j].b=1; 
		                        break;
							} 
							else {
								sum+=a[i].p;
							}
					    } 
						else {
						    a[j].b=1;
					    }
					}
				}
			}
		}
	}
	cout<<sum;
return 0;
}