#include <bits/stdc++.h>
using namespace std;
struct qwq
{
	long long a,b,c;
}ikun[100005];
int main()
{
	int n,m=0,sum=0;
	cin >> n;
	for(int i=1;i<=n;i++)
	{
		cin >> ikun[i].a >> ikun[i].b >> ikun[i].c;
	}
	int k=ikun[1].c,t,you=0,TLE[100005],oi=0;
	sum+=ikun[1].b;
	for(int i=2;i<=n;i++)
	{
		if(ikun[i].a==0)
		{
			you++;
			TLE[oi++]=ikun[i].b;
			t=ikun[i].c-k;
		}
		if(t<=45 && ikun[i].a==1 && you>0 && ikun[i].b<=TLE[oi])
		{
			you--;
		}
		else
		{
			sum+=ikun[i].b;
		}
		k=ikun[i].c;
	}
	cout << sum;
	return 0;
}