#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int op[N],price[N],t[N];
bool vis[N];
int bs(int lt,int rt,int k)
{
	int l=lt,r=rt;
	while(l<=r)
	{
		int mid=(l+r)>>1;
		if(t[mid]==k)return mid;
		if(t[mid]<k)l=mid+1;
		else r=mid-1;
	}
}
int main()
{
	vis[0]=1;
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>op[i]>>price[i]>>t[i];
	int ans=0;
	for(int i=1;i<=n;i++)
	{
		bool f=1;
		if(op[i]==1)
		{
			for(int j=t[i]-45;j<t[i];j++)
			{
				int x=bs(1,i-1,j);
				if(!vis[x]&&price[x]>=price[i]&&op[x]==0)
				{
					vis[x]=1;
					f=0;
					break;
				}
			}
		}
		if(f)ans+=price[i];
	}
	cout<<ans;
}