#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/priority_queue.hpp>
#define int long long
const int MAXN=1e6+5;
int n;
struct node{
	int a,b,c;
}d[MAXN];
int cmp(node a,node b){
	double f=a.a-(a.c*a.b)+b.a-((a.c+b.c)*b.b);
	double k=b.a-(b.c*b.b)+a.a-((a.c+b.c)*a.b);
	return f>k;
}
signed main(){
	std::cin>>n;
	for(int i=1;i<=n;i++){
		std::cin>>d[i].a>>d[i].b>>d[i].c;
	}
	std::sort(d+1,d+n+1,cmp);
	int tim=0,ans=0;
	for(int i=1;i<=n;i++){
		tim+=d[i].c;
		//std::cout<<d[i].a<<' '<<d[i].b<<' '<<d[i].c<<'\n';
		ans+=d[i].a-(d[i].b*tim);
		
	}
	std::cout<<ans;
	return 0;
}