#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=2e5+10;
int n;
ll p[N],w[N],d[N];
ll ans;
ll solve(ll x){
	ll res=0;
	for(int i=1;i<=n;i++){
		if(p[i]-d[i]>x) res+=w[i]*(p[i]-d[i]-x);
		if(p[i]+d[i]<x) res+=w[i]*(x-p[i]-d[i]);
	}
	return res;
}
int main(){
	freopen("Concert.in","r",stdin);
	freopen("Concert.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%lld%lld%lld",&p[i],&w[i],&d[i]);
	ll l=-1e9,r=1e9,lmid,rmid;
	ll lans,rans;
	ans=1e18;
	while(l<=r){
		lmid=(2*l+r)/3;
		rmid=(l+2*r)/3;
		lans=solve(lmid);
		rans=solve(rmid);
		if(lans<=rans){
			ans=min(ans,lans);
			r=rmid-1;
		}
		else{
			ans=min(ans,rans);
			l=lmid+1;
		}
	}
	printf("%lld",ans);
	return 0;
}