#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int sum = 0;
int way[N];
struct Node {
    int price, time1;
    bool aaa = false;
} a[N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(),cout.tie();
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> way[i];
        cin >> a[i].price >> a[i].time1;
        if (way[i] == 0) {
            sum += a[i].price;
        }
    }
    vector<Node> dis;
    for (int i = 1; i <= n; i++) {
        if (way[i] == 1) { 
            bool used = false;
            for (auto &num : dis) {
                if (!num.aaa && a[i].time1 - num.time1 <= 45 && a[i].price <= num.price) {
                    used = true;
                    num.aaa = true; 
                    break;
                }
            }
            if (!used) {
                sum += a[i].price;
            }
        } else {

            dis.push_back(a[i]);
        }
    }

    cout << sum << endl;
    return 0;
}