#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
struct B {
	bool tra;
	int price, time;
};
struct coupon {
	int t;
	int p;
};
int main() {
	int n;
	cin >> n;
	B a[10000];
	queue<coupon> b;
	int sum = 0;
	int t = 0;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].tra >> a[i].price >> a[i].time;
		if (a[i].tra == 0) {
			sum += a[i].price;
			b.push(coupon(a[i].time, a[i].price));
		}
		else if (a[i].tra == 1) {
			while (b.size()) {
				if (a[i].time - b.front().t <= 45 && a[i].price <= b.front().p) {
					break;
				}
				b.pop();
			}
			if (b.size() == 0) {
				sum += a[i].price;
			}
		}
	}
	cout << sum;
	return 0;
}