#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(1 + n), g(1 + n), d(1 + n);
for (int i = 1; i <= n; i++) {
cin >> x[i] >> g[i] >> d[i];
}
vector<long long> pd(1 + n, 0), pg(1 + n, 0), PG(1 + n, 0);
for (int i = 1; i <= n; i++) {
pd[i] = d[i] + pd[i - 1];
pg[i] = g[i] + pg[i - 1];
}
long long ans = 0;
for (int r = 1; r <= n; r++) {
long long mn = 1e18;
for (int l = 1; l <= r; l++) {
if (pd[r] - x[r] >= pd[l - 1] - x[l]) {
mn = min(mn, 1LL * pg[l - 1]);
}
}
ans = max(ans, pg[r] - mn);
}
cout << ans << '\n';
return 0;
}
