#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;
const int T = 1e9 + 5;
int x[N][3];
int y[N][2];
int n ;
int ans = 0;
int tmp = 0;
bool A;
int head=0,tail=0;

signed main(void)
{
	scanf("%d"  , &n);
	for(int i = 0 ; i < n ;  i++)
	{
		scanf("%d%d%d" , &x[i][0] , &x[i][1] , &x[i][2]);
	}
	for(int i = 0 ; i < n ; i++)
	{
		if(x[i][0] == 0)
		{
			y[tmp][0] = x[i][1] ;
			y[tmp][1] = x[i][2] + 45 ;
			tmp++;
			tail++;
			ans += x[i][1];
		}
		else if(x[i][0] == 1)
		{
			A = true;
			for(int j = head ; j <= tail; j++)
			{
			    if(y[j][1]<x[i][2]){head++;continue;}
			    else if(y[j][0]>=x[i][1]){A=false;break;}
			}
			if(A) ans += x[i][1];
		}
	}
	printf("%d" , ans);
	return 0;
}