#include<bits/stdc++.h>
#define el '\n'
using namespace std ;
const int MN = 1e5 + 6;
const int64_t inf = 1e18;
int x[MN] , g[MN] , d[MN] , n;
namespace sub_trau{
void solve(){
int64_t ans = 0;
vector<int64_t> pref_gold(n + 5) , pref_en(n + 5);
for ( int i = 1 ; i <= n ; i++ ){
pref_gold[i] = pref_gold[i - 1] + g[i];
pref_en[i] = pref_en[i - 1] + d[i];
}
for ( int i = 1 ; i <= n ; i++ ){
for ( int j = i ; j <= n ; j++ ){
if (pref_en[j] - pref_en[i - 1] >= x[j] - x[i]) ans = max(ans , pref_gold[j] - pref_gold[i - 1]);
}
}
cout << ans;
}
}
namespace sub_final{
struct Segtri{
vector<int64_t> st;
Segtri(int n) : st(4 * n + 5) {
for ( int i = 1 ; i <= n ; i++ ) st[i] = inf;
}
void update(int id , int l , int r , int i , int val){
if (i < l || i > r) return;
if (l == r){
st[id] = val;
return;
}
int mid = l + r >> 1;
update(id << 1 , l , mid , i , val);
update(id << 1 | 1 , mid + 1 , r , i , val);
st[id] = min(st[id << 1] , st[id << 1 | 1]);
}
int walk(int id , int l , int r , int64_t x){
if (st[id] > x) return -1;
if (l == r) return l;
int mid = l + r >> 1;
if (st[id << 1] <= x) return walk(id << 1 , l , mid , x);
return walk(id << 1 | 1 , mid + 1 , r , x);
}
};
void solve(){
vector<int64_t> pref(n + 5) , f(n + 5);
for ( int i = 1 ; i <= n ; i++ ){
pref[i] = pref[i - 1] + g[i];
f[i] = f[i - 1] + d[i];
}
Segtri it(n);
it.update(1 , 0 , n , 0 , 0);
for ( int i = 1 ; i <= n ; i++ ) it.update(1 , 0 , n , i , f[i - 1] - x[i]);
int64_t ans = 0;
for ( int i = 1 ; i <= n ; i++ ){
int pos = it.walk(1 , 0 , n , f[i] - x[i]);
assert(pos != -1);
if (pos != i) ans = max(ans , pref[i] - pref[pos]);
else ans = max(ans , pref[i] - pref[pos - 1]);
}
cout << ans;
}
}
int32_t main (){
// freopen("divide.inp" , "r" , stdin);
// freopen("divide.out" , "w" , stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for ( int i = 1 ; i <= n ; i++ ) cin >> x[i] >> g[i] >> d[i];
if (n <= 5000){
sub_trau::solve();
return 0;
}
sub_final::solve();
}
