#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <climits>
#include <iomanip>
#include <string>
using namespace std;
typedef long long ll;
int n, ans;
struct www{
	int t, p, f;
}q[100010];
int main(){
	scanf("%d", &n);
	int op, p, t, k = 0, f = 1;
	while (n--){
		scanf("%d%d%d", &op, &p, &t);
		if (op == 0){
			k++;
			q[k].t = t + 45;
			q[k].p = p;
			q[k].f = 0;
			ans += p;
		}
		else {
			for (int i = f; i <= k; i++){
				if (q[i].f == 0 && t > q[i].t){
					f = i;
					break;
				}
				if (q[i].f == 0 && p <= q[i].p){
					q[i].f = 1;
					ans -= p;
					break;
				}
			}
			ans += p;
		}
	}
	printf("%d\n", ans);
	return 0;
}