#include <bits/stdc++.h>
#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second
using namespace std;
using ll = long long;
const int N = 1e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 , mod = 1e9+7 , P = 6547;
ll x[N] , g[N], d[N] , p[N] , ps[N];
ll t[10*N];
int sz = 1;
int n;
void upd(int pos , ll val , int u = 1, int ul = 1, int ur = 2*n) {
t[u] = min(t[u] , val);
if(ul == ur) {
return;
}
int um = ul+ur >> 1;
if(pos <= um) {
upd(pos , val , u<<1 , ul , um);
}
else {
upd(pos , val , u<<1|1 , um+1 , ur);
}
}
ll get(int pos , int u = 1 , int ul = 1, int ur = 2*n) {
if(pos <= ul) {
return t[u];
}
if(ur < pos) return INF;
int um = ul+ur >> 1;
return min(get(pos , u<<1 , ul, um) , get(pos , u<<1|1 , um+1,ur));
}
void solve(int tc) {
cin >> n;
set<ll> st;
fill(t , t+10*N , INF);
for(int i = 1; i <= n; i ++) {
cin >> x[i] >> g[i] >> d[i];
p[i] = p[i-1] + d[i];
ps[i] = ps[i-1] + g[i];
st.insert(x[i] - p[i]);
st.insert(x[i] - p[i-1]);
}
map<ll,int> mp;
int cnt = 1;
for(auto to: st) {
mp[to] = cnt++;
}
ll ans = 0;
for(int i = 1; i <= n; i ++) {
upd(mp[x[i] - p[i-1]] , ps[i-1]);
int cur = x[i] - p[i];
ans = max(ans , ps[i] - get(mp[cur]));
}
cout << ans;
}
/*
*/
main() {
ios;
int tt = 1 , tc = 0;
// cin >> tt;
while(tt --) {
solve(++tc);
}
return 0;
}
