//#include<fstream>
#include<iostream>
#include<algorithm>
using namespace std;
typedef struct doll{ int out,in,cost; }T;
T a[1015];
bool viz[1015];

bool cmp(const T &a, const T &b){
     if(a.cost!=b.cost) return (a.cost < b.cost);
	 if(a.out != b.out) return (a.out<b.out);	 
     return (a.in < b.in); 
     }

int main(){
/*
   #ifndef ONLINE_JUDGE
   ifstream cin("dolls.in");
   ofstream cout("dolls.out");
   #endif
   */
   int N,i,j,x,y,z,ind;
   long long ans=0;
   
   //ios_base::sync_with_stdio(0);
   
   cin>>N;
   for(i=1;i<=N;++i)
   {
     cin>>x>>y>>z;
     a[i].out=x;
     a[i].in=y;
     a[i].cost=z;                
   }
    
   sort(a+1,a+N+1,cmp);

   for(i=N;i>0;--i)
     {
       ind = 0;
       
       for(j=N;j>0;--j)
         if(!viz[j] && a[i].in > a[j].out)
         { 
		   if(!ind) ind = j;
		   else if(a[j].out > a[ind].out) ind = j; 
         }
         
       if(!ind) ans += (long long)a[i].in * a[i].cost;
	   else
	   {
	   	  viz[ind] = 1;
	   	  ans += (long long)(a[i].in-a[ind].out) * a[i].cost;	   	
	   }     
     }
   
   cout<<ans<<'\n';
   
 return 0;   
}