#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
template<typename T> inline void chmax(T &_a, const T &_b){ (_b>_a) ? (_a=_b) : (_a); }
template<typename T> inline void chmin(T &_a, const T &_b){ (_b<_a) ? (_a=_b) : (_a); }

int n, a[500500], b[500500]; ll x[500500];
pair<int, ll> p[1000100]; int cp = 0;

bool win(int i, int j, int k){
	return (__int128)(p[j].first - p[i].first) * (p[k].second - p[i].second) - (__int128)(p[k].first - p[i].first) * (p[j].second - p[i].second) <= 0;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> n;
	ll sum = 0, ans = -INF;
	p[cp++] = make_pair(1, 0);
	rep(i, n) cin >> a[i] >> b[i] >> x[i], sum -= 4 * x[i], x[i] *= 2, p[cp++] = make_pair(a[i], x[i]), p[cp++] = make_pair(b[i], x[i]);
	sort(p, p + cp);
	for(int i = 1; i < cp; ++i) p[i].second += p[i - 1].second;

	static int h[1000100], ch = 0;
	rep(i, cp){
		if(i < cp - 1 && p[i].first == p[i + 1].first) continue;
		while(ch >= 2 && win(i, h[ch - 1], h[ch - 2])) --ch;
		h[ch++] = i;
	}

	rep(i, cp){
		while(ch >= 2 && p[h[ch - 2]].second - 4ll * p[h[ch - 2]].first * p[i].first >= p[h[ch - 1]].second - 4ll * p[h[ch - 1]].first * p[i].first) --ch;
		chmax(ans, p[i].second + p[h[ch - 1]].second - 4ll * p[h[ch - 1]].first * p[i].first);
	}
	cout << sum + ans << "\n";

	return 0;
}