#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dbg(...) 47
#endif
#define int long long
constexpr int inf = 1e18;
struct SegmentTree {
int n;
vector<int> t;
SegmentTree(int _n) {
n = _n;
t.assign(4 * n, inf);
}
int merge(int x, int y) {
return min(x, y);
}
void update(int id, int tl, int tr, int i, int v) {
if (tl == tr) {
t[id] = v;
return;
}
int x = (id << 1) + 1, y = x + 1, tm = (tl + tr) >> 1;
if (i <= tm) {
update(x, tl, tm, i, v);
} else {
update(y, tm + 1, tr, i, v);
}
t[id] = merge(t[x], t[y]);
}
int get(int id, int tl, int tr, int l, int r) {
if (r < tl || tr < l) return inf;
if (l <= tl && tr <= r) return t[id];
int x = (id << 1) + 1, y = x + 1, tm = (tl + tr) >> 1;
return merge(get(x, tl, tm, l, r), get(y, tm + 1, tr, l, r));
}
void update(int i, int v) { update(0, 0, n - 1, i, v); }
int get(int l, int r) { return get(0, 0, n - 1, l, r); }
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> x(n), g(n), d(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> g[i] >> d[i];
}
vector<int> p(n + 1), k(n + 1);
for (int i = 0; i < n; i++) {
p[i + 1] = p[i] + d[i];
k[i + 1] = k[i] + g[i];
}
int ans = 0;
// for (int i = 1; i < n; i++) {
// int s = p[i + 1] - x[i];
// t.update(i, p[i] - x[i]);
// }
for (int i = 0; i < n; i++) {
int s = p[i + 1] - x[i];
for (int j = 0; j < i; j++) {
if (p[j] - x[j] <= s) {
ans = max(ans, k[i + 1] - k[j]);
}
}
}
cout << ans << '\n';
return 0;
}
