#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int N = 1e5 + 69;
const ll INF = 1e18 + 69;
int n;
int x[N], g[N], d[N];
ll actual[N];
struct FenwickTree{
int n;
vector<ll> a;
FenwickTree(int _n){
n = _n;
a.resize(n+1, INF);
}
void update(int i, ll v){
while(i <= n){
minimize(a[i], v);
i += LASTBIT(i);
}
}
ll get(int i){
ll ans = INF;
while(i > 0){
minimize(ans, a[i]);
i -= LASTBIT(i);
}
return ans;
}
};
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
cin >> n;
for(int i = 0; i<n; ++i) cin >> x[i] >> g[i] >> d[i];
ll sum = 0;
vector<int> b;
for(int i = 0; i<n; ++i) {
actual[i] = sum - x[i];
sum += d[i];
b.push_back(actual[i]);
}
remove_dup(b);
FenwickTree bit(b.size());
sum = 0;
ll sum_g = 0, ans = 0;
for(int i = 0; i<n; ++i){
int idx = lower_bound(ALL(b), actual[i]) - b.begin() + 1;
bit.update(idx, sum_g);
sum += d[i];
sum_g += g[i];
ll cur = sum - x[i];
idx = upper_bound(ALL(b), cur) - b.begin();
maximize(ans, sum_g - bit.get(idx));
}
cout << ans << "\n";
cerr << "Time elapsed: " << clock() - start << " ms\n";
return 0;
}
