#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<algorithm>
using namespace std;
const int N=1e5;
struct node{
	int m,t,o;
}a[N+30];
int n,ans,p;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d%d%d",&a[i].o,&a[i].m,&a[i].t);
		if(a[i].o==0){
			ans+=a[i].m;
		}
		else{
			while(a[i].t-a[p].t>45) p++;
			int q=p;
			while((a[p].o==1||a[p].m<a[i].m)&&p<i){
				p++;
			}
			if(p>=i) ans+=a[i].m,p=q;
		}
	}
	return printf("%d",ans),0;
}