#include<bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define pb emplace_back
#define pii pair<int,int>
using namespace std;
const int N=2e5+5,inf=1e15;
int n,maxp,minl,sumw,ans,sum;
struct aske{
	int p,w,d;
}a[N];
vector<pii>v;
signed main(){
	freopen("Concert.in","r",stdin);
	freopen("Concert.out","w",stdout);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i(1);i<=n;++i){
		cin>>a[i].p>>a[i].w>>a[i].d;
		int l=a[i].p-a[i].d,r=a[i].p+a[i].d;
		sumw+=a[i].w;
		maxp=max(maxp,a[i].p); 
		minl=min(minl,l);
		v.pb(l,i);v.pb(r,i);
	}
	sumw=-sumw;
	sort(v.begin(),v.end());
	for(int i(1);i<=n;++i){
		ans+=(a[i].p-a[i].d-minl)*a[i].w;
	}
	sum=ans;
	for(auto& i:v){
		if(i.fi>maxp) break;
		sum+=sumw*(i.fi-minl);
		sumw+=a[i.se].w;
		minl=i.fi;
		ans=min(ans,sum);
	}
	cout<<ans<<"\n";
	return 0;
}