//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
using Line=pair<ll,ll>;
#define ls (x<<1)
#define rs (ls|1)
int n;
ll a[500500],b[500500],x[500500];
map<ll,ll> Mp;
vector<ll> pool;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i]>>b[i]>>x[i];
	for(int i=1;i<=n;i++)
	{
		pool.pb(a[i]);
		pool.pb(b[i]);
		Mp[a[i]]+=x[i];
		Mp[b[i]]+=x[i];
	}
	pool.pb(0);
	pool.pb(1);
	srt(pool);
	uni(pool);
	vector<ll> cost(sz(pool));
	vector<Line> vec;
	cost[0]=-2*accumulate(x+1,x+n+1,0ll);
	for(int i=1;i<sz(pool);i++)
		cost[i]=cost[i-1]+2*Mp[pool[i]];
	for(int i=1;i<sz(pool);i++)
		vec.pb(mp(4*pool[i],cost[i]));
	srt(vec);
	vector<Line> v2;
	for(auto L:vec)
	{
		while(sz(v2)>1)
		{
			Line A=v2[sz(v2)-2],B=v2[sz(v2)-1];
			if((longer)(L.second-B.second)*(longer)(B.first-A.first)>=(longer)(L.first-B.first)*(longer)(B.second-A.second))
				v2.pop_back();
			else
				break;
		}
		v2.pb(L);
	}
	int p=sz(v2)-1;
	ll ans=-1ll*inf*inf;
	for(int i=1;i<sz(pool);i++)
	{
		while(p&&v2[p].second-v2[p].first*pool[i]<v2[p-1].second-v2[p-1].first*pool[i])
			p--;
		ans=max(ans,cost[i]+v2[p].second-v2[p].first*pool[i]);
	}
	cout<<ans<<endl;
	return 0;
}