#include<iostream>

 #include<cstdio>

 using namespace std;

 const int maxn=;

 int n,x,p[maxn],t[maxn],a[maxn],cnt,fir=;

 long long ans;

 int main()

 {

     cin>>n;

     for(int i=;i<=n;i++){

         scanf("%d%d%d",&x,&p[i],&t[i]);

         while(fir<=cnt&&(a[fir]==||t[i]-t[a[fir]]>)) fir++;

         ans+=p[i];

         if(x==){

             a[++cnt]=i;

         }else{

             for(int j=fir;j<=cnt;j++){

                 if(a[j]==) continue;

                 if(p[i]<=p[a[j]]){

                     a[j]=;

                     ans-=p[i];

                     break;

                 }

             }

         }

     }

     cout<<ans<<endl;

     return ;

 }