#include <bits/stdc++.h>
#define nl '\n'
#define pb push_back
#define E exit(0)
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define sz(s) (s).size()
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
const int N=5e5+5;
const int INF=1e9+7;
const int eps=1e-6;
void solve() {
int n;
cin>>n;
int x[n+1],g[n+1],d[n+1];
for (int i=1;i<=n;i++) cin>>x[i]>>g[i]>>d[i];
int mx=0;
for (int i=1;i<=n;i++) {
int x1,d1,g1;
x1=0;
d1=d[i];
g1=g[i];
for (int j=i+1;j<=n;j++) {
x1+=x[j]-x[j-1];
d1+=d[j];
if (d1>=x1) g1+=g[j];
}
mx=max(mx,g1);
}
cout<<mx;
cout<<nl;
}
ll test=1;
int main () {
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
ios_base::sync_with_stdio(0);
cin.tie();
// cin>>test;
while (test--) solve();
return 0;
}
