#include <bits/stdc++.h>
using namespace std;
long long read() {
	long long x = 0,f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-') {
			f = -1;
		}
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = (x << 1) + (x << 3) + (ch ^ 48);
		ch = getchar();
	}
	return x * f;
}
long long n,type,price,t,pre,newpre,ans;
struct node {
	long long price,t;
	bool f;
};
vector<node> v;
int main() {
	n = read();
	for (int i = 1; i <= n; i++) {
		type = read(),price = read(),t = read();
		if (!(type)) {
			v.push_back({price,t,true});
			ans += price;
		} else {
			while (t - v[pre].t > 45) {
				pre++;
				if (pre == v.size()) {
					ans += price;
					break;
				}
			}
			newpre = pre;
			while (v[newpre].price < price || !(v[newpre].f)) {
				newpre++;
				if (newpre == v.size()) {
					ans += price;
					break;
				}
			}
			v[newpre].f = false;
		}
	}
	cout << ans;
	return 0;
}