#include<bits/stdc++.h>
#define N 200001
#define ll long long
using namespace std;
int n,l,r,mid;
ll sum1,sum2,ans=1e18;
struct node{
	ll p,w,d;
}a[N];
bool cmp(node x,node y){return x.p<y.p;}
int main(){
	freopen("Concert.in","r",stdin);
	freopen("Concert.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++) cin>>a[i].p>>a[i].w>>a[i].d;
	if(n==1){
		cout<<0<<endl;
		return 0;
	}
	sort(a+1,a+n+1,cmp);
	l=a[1].p;
	r=a[n].p;
	while(l<=r){
		mid=(l+r+1)/2;
		for(int i=1;i<=n;i++) sum1+=max((ll)0,abs(mid-a[i].p)-a[i].d)*a[i].w;
		//cout<<l<<' '<<r<<' '<<mid<<' '<<sum1<<endl;
		ans=min(sum1,ans);
		if(mid>l){
			for(int i=1;i<=n;i++) sum2+=max((ll)0,abs(mid-1-a[i].p)-a[i].d)*a[i].w;
			if(sum2<sum1) r=mid-1;
			else l=mid;
			ans=min(sum2,ans);
		}else if(mid<r){
			for(int i=1;i<=n;i++) sum2+=max((ll)0,abs(mid+1-a[i].p)-a[i].d)*a[i].w;
			if(sum2>sum1) r=mid;
			else l=mid+1;
			ans=min(sum2,ans);
		}else{
			cout<<ans<<endl;
			return 0;
		}
		sum1=sum2=0;
	}
	cout<<ans<<endl;
	return 0;
}