#include<bits/stdc++.h>
using namespace std;
int n,price,sum,t,ai,cc=1;
int tim[100005];
struct node 
{
	int begin,pp;
	bool able;
}ticket[100005];
bool search(int x,int y)
{
	for(int i=cc;i<=n;i++)
	{
		if(x-ticket[i].begin>45)cc=i+1;
		if(x-ticket[i].begin<=45&&ticket[i].able==1&&ticket[i].pp>=y)
		{
			ticket[i].able==0;
			return true;	
		}
	}
		
	return false;	
}
bool way;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>way>>price>>tim[i];
		if(way==0)
		{
			ticket[i].begin=tim[i];
			ticket[i].able=1;
			ticket[i].pp=price;
			sum+=price;
			continue;
		}
		else if(search(tim[i],price))
			continue;
	
		else sum+=price; 
	}
cout<<sum;
}