#include <bits/stdc++.h>
using namespace std;
struct f{
	int lei,qian,shi;
}a[100005];
int n,maxx,x;
long long ans;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].lei>>a[i].qian>>a[i].shi;
	}
	for(int i=1;i<=n;i++){
		if(a[i].qian==-1) continue;
		if(a[i].lei==0){
			maxx=-1;
			x=0;
			for(int j=i+1;j<=n;j++){
				if(a[j].shi-a[i].shi>45) break;
				if(a[j].lei==1 && a[j].qian<=a[i].qian && maxx<a[j].qian){
					maxx=a[j].qian;
					x=j;
				}
			}
		}
		a[x].qian=-1;
		ans+=a[i].qian; 
	}
	cout<<ans;
	return 0;
}