#include<bits/stdc++.h>

 #define ll long long

 using namespace std;

 const int maxx=1e5+;

 struct node{

     ll h,v,p;

     bool operator<(const node&a)const{

         return h<a.h;

     }

 }tree[maxx];

 ll B[],arr[maxx],pre[maxx];//B储存已经遍历过的树在该价值的数量，arr储存第i高及比第i高的树都被砍掉的花费，pre储存第i高树矮的树的数量

 int main()

 {

     ll n;

     while(~scanf("%lld",&n)){

         memset(B,,sizeof(B));

         for(int i=;i<=n;i++)scanf("%lld%lld%lld",&tree[i].h,&tree[i].v,&tree[i].p);

         sort(tree+,tree++n);//从低到高排序高度

         arr[n+]=;

         for(int i=n;i>=;i--)arr[i]=arr[i+]+tree[i].v*tree[i].p;

         pre[]=;

         for(int i=;i<=n;i++)pre[i]=pre[i-]+tree[i].p;

         ll ans=1e18;

         for(int i=,j=;i<=n;i=j){//从小到大枚举最大高度

             while(j<=n&&tree[j].h==tree[i].h)j++;

             ll sums=;

             for(int k=i;k<j;k++)sums+=tree[k].p;

             ll cost=arr[j];

             if(sums<=pre[i-]){//如果第i高的树的数量小于比它矮的树的数量，即将价值数组进行从小到大处理

                 ll need=pre[i-]-sums+;

                 for(int t=;t<=;t++){

                     if(B[t]<=need){

                         cost+=B[t]*t;

                         need-=B[t];

                     }else{

                         cost+=need*t;

                         break;

                     }

                 }

             }

             ans=min(ans,cost);

             for(int k=i;k<j;k++)B[tree[k].v]+=tree[k].p;

         }

         printf("%lld\n",ans);

     }

     return ;

 }

#include <bits/stdc++.h>

#define LL long long

using namespace std;

const int maxx=2e5+;

int tot;

struct Node{

    LL h,v,p;

    bool operator <(const Node &a)const

    {

        return a.h>h;

    }

}tree[maxx];

struct node{

    LL l,r,sum,num;

}p[maxx*];

LL v[maxx],root[maxx];

LL update(LL rot,LL l,LL r,LL pos,LL num)//建立主席树

{

    LL book=++tot;

    p[book]=p[rot];//传递上一颗主席树的性质进行修改

    p[book].num+=(LL)num;

    p[book].sum+=(LL)pos*(LL)num;

    if(l==r) return book;

    LL mid=l+r>>;

    if(pos<=mid) p[book].l=update(p[rot].l,l,mid,pos,num);

    else p[book].r=update(p[rot].r,mid+,r,pos,num);

    return book;

}

LL query(LL rot,LL l,LL r,LL num)//查询

{

    if(l==r) return (LL)l*(LL)num;

    LL ans=p[p[rot].l].num;

    LL mid=l+r>>;

    if(num<=ans) return query(p[rot].l,l,mid,num);

    else

    {

        return p[p[rot].l].sum+query(p[rot].r,mid+,r,num-ans);

    }

}

int main()

{

    int n;

    while(~scanf("%lld",&n)){

        tot=;

        memset(v,,sizeof(v));

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

            scanf("%lld%lld%lld",&tree[i].h,&tree[i].v,&tree[i].p);

        }

        sort(tree+,tree+n+);

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

            v[i]=v[i-]+tree[i].p;

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

            root[i]=update(root[i-],,,tree[i].v,tree[i].p);//主席树记录每种树的根节点

        }

        LL Minn=1e18,moneys=;

        for(int i=n;i>=;i--){

            LL treenum=,sums=;

            while(tree[i].h==tree[i-].h){

                treenum+=tree[i].v*tree[i].p;

                sums+=tree[i].p;

                i--;

            }

            treenum+=tree[i].v*tree[i].p;

            sums+=tree[i].p;

            LL Smoney=;

            if(v[i-]>=sums)Smoney=moneys+query(root[i-],,,v[i-]-sums+);//如果第i高的树的数量小于比它矮的树的数量，查询前i-1种树中的需要砍的树的花费

            else Smoney=moneys;

            Minn=min(Minn,Smoney);

            moneys+=treenum;//记录比第i种树高的树的砍掉的花费

        }

        printf("%lld\n",Minn);

    }

    return ;

}