#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+3;
int n, a[maxn], b[maxn], c[maxn], now = 0, pev = 0;
int money = 0;
struct node{
	int p;
	int T;
}q[maxn];
int main(){
	cin >> n;
	for(int i = 1;i <= n;i++){
		cin >> a[i] >> b[i] >> c[i];
		money += b[i];
		if(i == 1 && a[i] == 0){
			q[now].p = b[i], q[now].T = c[i];
			now++;
			continue;
		}
		if(a[i] == 0){
			q[now].p = b[i], q[now].T = c[i];
			now++;
		}
		else{
			int j = pev;
			while(j <= now){
				if(c[i] - q[j].T > 45){
					pev++, j++;
					continue;
				}
				else if(q[j].p >= b[i]){ 
					q[j].p = -1;
					money -= b[i];
					break;
				}
				j++;
			}
		}
	}
	cout << money ;
	return 0;
}