#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cmath>
#include<set>
#include<map>
using namespace std;
#define int long long
long long a[1000005],b[1000005],c[1000005],e[1000005],d[1000005];
signed main(){
	int n;
	cin>>n;
	int y=0;
	int jx=1;
	int jy=1;
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i]>>c[i];
		if(!a[i]){
			d[jx]=b[i];//价格 
			e[jx++]=c[i];//时间 
			y+=b[i];
		}
		else{
			for(int j=jy;j<=jx;j++){
				if(c[i]-e[j]>45){
					d[j]=-9999999999999ll;
					e[j]=22222222229999ll;
					jy++;
				}
				else if(d[j]<b[i]){
				}
				else{
					d[j]=-99999999999999ll;
					e[j]=22222222222222ll;
					b[i]=0; 
					break;
				}
			}
			y+=b[i];
		}
	}
	cout<<y;
    return 0;
}