#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>,
rb_tree_tag, tree_order_statistics_node_update> ordered_set;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
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<long long> pd(n), pg(n);
for (int i = 0; i < n; i++) {
pd[i] = d[i];
pg[i] = g[i];
if (i) pd[i] += pd[i - 1],
pg[i] += pg[i - 1];
}
long long ans = 0;
for (int l = 0; l < n; l++) {
for (int r = l; r < n; r++) {
if (pd[r] - (l ? pd[l - 1] : 0LL) >= x[r] - x[l]) {
ans = max(ans, pg[r] - (l ? pg[l - 1] : 0LL));
}
}
}
cout << ans << '\n';
return 0;
}
