#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 2000000
#define inf 1e36
using namespace std;
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;
}
__int128 n,length,a[N+1],b[N+1],S[N+1],x[N+1],st[N+1],dque[N+1],top,ans,res;
int main()
{
    n=read(),ans=-inf;
    for (int i=1;i<=n;++i) a[i]=read(),b[i]=read(),x[i]=read(),res+=4*x[i],st[++length]=a[i],st[++length]=b[i];
    st[++length]=1;
    sort(st+1,st+length+1),length=unique(st+1,st+length+1)-st-1;
    for (int i=1;i<=n;++i) S[lower_bound(st+1,st+length+1,a[i])-st]+=2*x[i],S[lower_bound(st+1,st+length+1,b[i])-st]+=2*x[i];
    for (int i=1;i<=length;++i) S[i]+=S[i-1];
    for (int i=1;i<=length;++i)
    {
	while (top>1&&(S[i]-S[dque[top]])*(st[dque[top]]-st[dque[top-1]])>=(S[dque[top]]-S[dque[top-1]])*(st[i]-st[dque[top]])) top--;
	dque[++top]=i;
    }
    for (int i=1;i<=length;++i)
    {
	while (top>1&&S[dque[top]]-S[dque[top-1]]<=4*st[i]*(st[dque[top]]-st[dque[top-1]])) top--;
	ans=max(ans,S[dque[top]]+S[i]-4*st[dque[top]]*st[i]);
    }
    printf("%lld\n",(long long)(ans-res));
    return 0;
}