#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 2000000
using namespace std;
const long long inf=(long long)(1e18);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int n,top,a[N+1],b[N+1],X[N+1],dque[N+1],tong[N+1],length;
long long s[N+1],res,ans=-inf;
bool check(int x,int y,int z)
{
	return (__int128)(s[y]-s[x])*(tong[z]-tong[x])<=(__int128)(s[z]-s[x])*(tong[y]-tong[x]);
}
long long F(int x,int y)
{
	return s[x]+s[y]-4ll*tong[x]*tong[y]-res;
}
int main()
{
	int ps;
	n=read(),tong[++length]=1;
	for (int i=1;i<=n;++i) a[i]=read(),b[i]=read(),X[i]=read(),tong[++length]=a[i],tong[++length]=b[i],res+=4ll*X[i];
	sort(tong+1,tong+length+1),length=unique(tong+1,tong+length+1)-tong-1;
	for (int i=1;i<=n;++i) s[lower_bound(tong+1,tong+length+1,a[i])-tong]+=(X[i]<<1),s[lower_bound(tong+1,tong+length+1,b[i])-tong]+=(X[i]<<1);
	for (int i=1;i<=length;++i) s[i]+=s[i-1];
	for (int i=1;i<=length;++i)
	{
		while (top>=2&&check(dque[top-1],dque[top],i)) top--;
		dque[++top]=i;
	}
	ps=top;
	for (int i=1;i<=top;++i)
	{
		while (ps-1>=1&&F(dque[ps-1],dque[i])>F(dque[ps],dque[i])) ps--;
		ans=max(ans,F(dque[ps],dque[i]));
	}
	printf("%lld\n",ans);
	return 0;
}