#include<bits/stdc++.h> using namespace std; struct node{ bool ty; int p, t; }qu[100010]; int f, b = 1; int n; int main(){ int ans = 0; cin >> n; for(int i = 1; i <= n; i++){ int a, bb, c; cin >> a >> bb >> c; node aa = {(bool)a, bb, c}; if (aa.ty){ bool flag = 0; for(int j = b; j <= f; j++) if(aa.t - qu[j].t <= 45){ if(aa.p<=qu[j].p){ flag = 1; qu[j].p = 0; break; } } else b = j; if (!flag) ans += aa.p; } else{ ans += aa.p; qu[++f] = aa; } } cout << ans; return 0; }