#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
long long ans=0,n;
long long flag[22233];
struct qwq{
	int f;
	long long price;
	long long time;
}a[222333];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].f>>a[i].price>>a[i].time;
		if(a[i].f==0)
		{
			ans+=a[i].price;
			flag[i]=0;
		}
		if(a[i].f==1)
		{
			for(int j=i>45?i-45:1;j<i;j++)
			{
				if(flag[j]==0&&a[j].f==0&&a[i].time-a[j].time<=45&&a[i].price<=a[j].price)
				{
					ans+=0;
					flag[i]=1;
					flag[j]=1;
					break;
				}
				if(j==i-1&&flag[i]!=1)
					ans+=a[i].price;
			}
		}
	}	
	cout<<ans<<endl;
	return 0;
}