#include<bits/stdc++.h>
using namespace std;
struct node{
	int lv,val;
};deque<node> dq,tmp;
int main(){
	int n,ans=0;
	cin>>n;
	for(int i=1;i<=n;i++){
		int typ,pri,tim;
		cin>>typ>>pri>>tim;
		if(typ==0){
			ans+=pri;
			dq.push_back({tim+45,pri});
		}else{
			while(dq.size() && dq.front().lv<tim) dq.pop_front();
			while(dq.size() && dq.front().val<pri){
				tmp.push_back(dq.front());
				dq.pop_front();
			}if(dq.empty()) ans+=pri;
			else dq.pop_front();
			while(tmp.size()){
				dq.push_front(tmp.back());
				tmp.pop_back();
			}
		}
	}cout<<ans;
	return 0;
}