#include<bits/stdc++.h>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#define fi first
#define se second
#define new new228
#define pb push_back
#define rank rank228
#define int long long
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
#pragma warning(disable : 4996)
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // st.oreder_of_key();
const int N = 100100;
const int INF = 1e15;
const int MAXN = 4 * N;
const int MOD = 998244353;
int TN = 1;
int n;
int x[N], g[N], d[N];
int preg[N], pred[N];
int a[N], b[N], t[4 * N];
vector<int> verr;
void update(int v, int tl, int tr, int pos, int val) {
if (tl == tr) {
t[v] = min(t[v], val);
return;
}
int tm = (tl + tr) >> 1;
if (pos <= tm) {
update(v << 1, tl, tm, pos, val);
} else {
update(v << 1 | 1, tm + 1, tr, pos, val);
}
t[v] = min(t[v << 1], t[v << 1 | 1]);
}
int get(int v, int tl, int tr, int l, int r) {
if (tl > r || tr < l) {
return INF;
}
if (tl == l && tr == r) {
return t[v];
}
int tm = (tl + tr) >> 1;
return min(get(v << 1, tl, tm, l, min(tm, r)), get(v << 1 | 1, tm + 1, tr, max(tm + 1, l), r));
}
void solve() {
scanf("%lld", &n);
for (int i = 1; i <= n; i++) {
scanf("%lld %lld %lld", &x[i], &g[i], &d[i]);
d[i] += d[i - 1]; g[i] += g[i - 1];
verr.pb(x[i] - d[i - 1]);
}
sort(all(verr));
// verr.erase(unique(all(verr)), verr.end());
/*
for (auto i: verr) {
printf("%lld ", i);
}
printf("\n\n");
*/
memset(t, 0x3f, sizeof(t));
for (int i = 1; i <= n; i++) {
int now = x[i] - d[i - 1];
int cur = lower_bound(all(verr), now) - verr.begin();
// printf("%lld %lld\n", now, cur);
update(1, 0, n, cur, i);
}
// printf("\n");
int ans = 0;
for (int i = 1; i <= n; i++) {
int cur = lower_bound(all(verr), x[i] - d[i]) - verr.begin();
int p = get(1, 0, n, cur, n);
// printf("%lld\n", p);
if (p <= n) {
ans = max(ans, g[i] - g[p - 1]);
}
}
printf("%lld\n", ans);
return;
}
signed main() {
// ios_base::sync_with_stdio(0);
// in; out; // cin >> TN;
while (TN--) { solve(); }
return 0;
}
