#include <iostream>
#include <cstdlib>
using namespace std;
struct o{int b,e,a,d,c;};int l(const void* a,const void* b){o* p1=(o*)a;o* p2=(o*)b;
return p1->b-p2->b;}int f(const void* a,const void* b){o* p1=(o*)a;o* p2=(o*)b;
return p1->e-p2->e;}int m(const void* a,const void* b){o* p1=(o*)a;o* p2=(o*)b;
return p1->a-p2->a;}int main(){int i,j,n,b,e,a;long g;cin>>n;o c[n],q[n];int h[1001];
for(i=0;i<=1000;i++)h[i]=-1;for(i=0;i<n;i++){cin>>b>>e>>a;c[i].b=b;c[i].e=e;c[i].a=a;
c[i].d=e*a;c[i].c=0;}qsort(c,n,sizeof(o),l);i=j=0;while(i<n){while(c[i].b==c[j].b&&j<n)
j++;h[c[i].b]=i;i=j;}for(i=0;i<n;i++)q[i]=c[i];qsort(q,n,sizeof(o),m);i=j=0;while(i<n){
while(q[i].a==q[j].a&&j<n)j++;qsort(&q[i],j-i,sizeof(o),f);i=j;}for(i=n-1;i>=0;i--)
{e=q[i].e-1;while(h[e]<0&&e>=1)e--;if(e<1)continue;j=h[e];while(c[j].c&&j>=0)j--;
if(j>=0){q[i].d-=q[i].a*c[j].b;c[j].c=1;}}g=0L;for(i=0;i<n;i++)g+=(long)q[i].d;cout<<g;return 0;}