#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 5e5+10;
const int MAXA = 2e3+10;
const int INF = 1e18+10;
const int LOG = 19;
const int MOD = 1e9+7;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
void chmx(int &a, int b){ a = max(a, b); }
int n, x[MAXN], g[MAXN], d[MAXN], prg[MAXN], prd[MAXN];
signed main(){
// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
int ANS = 0;
for(int i=1; i<=n; i++){ cin >> x[i] >> g[i] >> d[i]; chmx(ANS, g[i]); }
for(int i=1; i<=n; i++) prg[i] = prg[i-1]+g[i];
for(int i=1; i<=n; i++) prd[i] = prd[i-1]+d[i];
vector <pii> vec;
for(int i=1; i<=n; i++){
vec.pb({x[i]-prd[i], -i}); // query
vec.pb({x[i]-prd[i-1], i}); // update
}
sort(vec.rbegin(), vec.rend());
// for(auto in : vec) cout << in.se << " se\n";
set <int> s;
for(auto in : vec){
if(in.se > 0){
s.insert(in.se);
} else {
in.se = -in.se;
if(!s.empty() && *(s.begin()) < in.se){
int idx = in.se;
int id = *(s.begin());
chmx(ANS, prg[idx]-prg[id-1]);
}
}
}
cout << ANS << '\n';
}
