#include<iostream>
#include<queue>
using namespace std;
long long a,b,c,m=0,n,ans=0,md;
queue<long long>time;
queue<long long>mony;
bool yy=0;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a>>b>>c;
		if(a==0)
		{
			ans+=b;
			m++;
			time.push(c);
			mony.push(b);
		}
		while(!time.empty()&&c-time.front()>45)
		{
			time.pop();
			mony.pop();
			m--;
		}
		md=m;
		 if(a==1)
		{
			if(!time.empty())
			{
				for(int j=1;j<=md;j++)
				{
					if(b<=mony.front()&&yy==0)
				   {
					m--;
					yy=1;
					time.pop();
					mony.pop();
				   }
				   else 
				   {
				   	time.push(time.front());
				   	mony.push(mony.front());
				   	time.pop();
				   	mony.pop();
				   }
				}
			
			}
			else 
			{
				ans+=b;
				continue;
			}
			if(yy==0)
			ans+=b;
		}
			
	}
	cout<<ans;
	return 0;//谢谢~ 
}