#include<bits/stdc++.h>
using namespace std;
int n;
struct Node{
	bool tra;
	int pri;
	int t;
};
Node k[1000001];
queue<int> q;
queue<int> w;
int ans;
signed main()
{
	ios::sync_with_stdio(false);
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>k[i].tra>>k[i].pri>>k[i].t;
	}
	for(int i=1;i<=n;i++)
	{
		if(k[i].tra==0)
		{
			ans+=k[i].pri;
			q.push(k[i].pri);
			w.push(k[i].t);
			continue;
		}
		else
		{
			bool yu=0;
			if(!q.empty()&&!w.empty())
			{
				int x=q.front();
				int y=w.front();
				while(k[i].t-y>45)
				{
					q.pop();
					w.pop();
					if(q.empty())
					{
						yu=1;
						break;
					}
					x=q.front();
					y=w.front();
				}
			}
			if(!yu)
			{
				q.pop();
				w.pop();
				continue;
			}
			else
			{
				ans+=k[i].pri;
			}
		}
	}
	cout<<ans;
	return 0;
}