#include <bits/stdc++.h>
using namespace std;
#define SPEED ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define str string
#define pb push_back
#define pf push_front
#define nl "\n"
#define ll long long
#define int long long
#define all(v) (v).begin() , (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ff first
#define ss second
#define len(a) a.size()
#define pii pair<int,int>
const int N = 100000 + 4;
const ll md = 998244353;
const ll mod = 1e9 + 7;
const ll mega = 1e6 + 3;
const ll inf = 100100;
int x[N] , g[N] , d[N] , pref[N] , pref2[N] ,n , ans , mx;
void add(int l){
ans += d[l];
}
void del(int l){
ans -= d[l];
}
void solve() {
cin >> n;
for(int i = 1; i <= n; ++i){
cin >> x[i] >> g[i] >> d[i];
pref[i] = pref[i - 1] + d[i];
pref2[i] = pref2[i - 1] + g[i];
}
int mx = 0;
if(n <= 5000){
for(int i = 1; i <= n; ++i){
for(int j = i; j <= n; ++j){
if(x[j] - x[i] <= pref[j] - pref[i - 1]){
mx = max(mx , pref2[j] - pref2[i - 1]);
}
}
}
cout << mx;
}
else{
for(int i = 1; i <= n; ++i){
for(int j = i; j <= min(n , i + 1000); ++j){
if(x[j] - x[i] <= pref[j] - pref[i - 1]){
mx = max(mx , pref2[j] - pref2[i - 1]);
}
}
for(int j = n; j >= max(i , n - 1000); --j){
if(x[j] - x[i] <= pref[j] - pref[i - 1]){
mx = max(mx , pref2[j] - pref2[i - 1]);
}
}
}
cout << mx;
}
}
signed main() {
SPEED;
int t = 1;
// cin >> t;
while (t--) {
solve();
}
// #ifndef ONLINE_JUDGE
// cerr << "\n" << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
// #endif
// return 0;
}
