#include <cstdio> #include <algorithm> using namespace std; int n; long long x[100005], g[100005], d[100005]; long long piv[100005]; struct cmp{ bool operator()(int a, int b){ return a > b; } }; int main(){ scanf("%d",&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]; piv[i] = d[i] - x[i]; } for (int i=n-1; i; i--) { piv[i] = max(piv[i],piv[i+1]); } long long r = 0; for (int i=1; i<=n; i++) { auto pt = upper_bound(piv+1,piv+n+1,x[i] - d[i-1],cmp()); pt--; r = max(r,g[(pt - piv)] - g[i-1]); } printf("%lld",r); }