#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+10;
int n;
ll s[N],f[N];
struct node{
	int x,v;
	bool operator<(const node h)const{if(x^h.x)return x<h.x;}
}a[N];
ll X(int x){return a[x].x;}
ll Y(int x){return f[x];}
int q[N],h,t;
bool check(int i,int j,int k){
	__int128 x=(Y(i)-Y(j))*(X(j)-X(k));
	__int128 y=(Y(j)-Y(k))*(X(i)-X(j));
	return x<y;
}
signed main(){
//	freopen("data3.in","r",stdin);
	scanf("%d",&n),n<<=1;
	for(int i=1;i<=n;i+=2){
		scanf("%d%d%d",&a[i].x,&a[i+1].x,&a[i].v),a[i+1].v=a[i].v;
	}
	a[0].x=1;
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++)s[i]=s[i-1]+a[i].v;
	for(int i=0;i<=n;i++)f[i]=s[i]+s[i]-s[n];
	ll ans=-2ll*s[n]-4;
	if(n<=4000){
		for(int i=0;i<=n;i++){
			for(int j=0;j<=i;j++)ans=max(ans,f[i]+f[j]-4ll*a[i].x*a[j].x);
		}
	}else{
		q[h=t=1]=0;
		for(int i=1;i<=n;i++){
			while(h<t&&(Y(q[t])-Y(q[t-1]))<4ll*X(i)*(X(q[t])-X(q[t-1])))--t;
			if(h<=t&&X(q[t])==X(i))--t;
			ans=max(ans,f[i]+f[q[t]]-4ll*a[i].x*a[q[t]].x);
			if(h>=t||check(i,q[t],q[t-1]))q[++t]=i;
			ans=max(ans,f[i]+f[i]-4ll*a[i].x*a[i].x);
		}
	}
	printf("%lld\n",ans);
}