#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
typedef long long int ll;
struct camp {
int x,g,d;
};
vector<camp> v;
const int N=1e6+7;
ll p[N];
ll sum[N];
int main()
{
ios_base:: sync_with_stdio(false); cin.tie(0);
int n; cin>>n;
v.resize(n+1);
for(int i=1; i<=n; i++) {
cin>>v[i].x>>v[i].g>>v[i].d;
p[i]=p[i-1]+v[i].d;
sum[i]=sum[i-1]+v[i].g;
}
ll ans=0;
for(int i=1; i<=n; i++) {
for(int j=i; j<=n; j++) {
if(v[j].x-v[i].x<=p[j]-p[i-1]) {
// cout<<i<<" "<<j<<endl;
ans=max(ans,sum[j]-sum[i-1]);
}
}
}
cout<<ans<<endl;
return 0;
}
