#include<bits/stdc++.h>
using namespace std;
struct node{
    int t,m;
};
node a[100000000],b[100000000];
int main(){
	int n,f,k=0,g=0,ans=0,d=0;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>f;
		if(f==0){
		    cin>>a[k].m>>a[k].t;
		    ans+=a[k].m;  
		    k++;
		}
		if(f==1){
			cin>>b[g].m>>b[g].t;
			g++;
		}
	}
	for(int i=0;i<g;i++){
		d=1;
		while(1){ 
			if(d>k){
				ans+=b[i].m;
				break;
			}
			if((b[i].t>a[d].t+45||a[d].m<b[i].m)&&d==k){
				ans+=b[i].m;
				break;
			}
			else if((b[i].t-a[d].t>=0)&&(b[i].t-a[d].t<=45)&&(a[d].m>=b[i].m)){
			    for(int j=d;j<k;j++){
				    a[j].m=a[j+1].m;
				    a[j].t=a[j+1].t;
				}
				k--;
				break;
		 	}
			else{
			    d++;
				continue;
			}
		}
	}
	cout<<ans;
	return 0;
}