#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main(void) {
int n;
cin >> n;
vector <pair <int,pair <int,int>>> a;
for(int i = 0; i < n; i ++) {
int d, x, y;
cin >> d >> x >> y;
a.push_back({d, {y, x}});
}
sort(a.begin(), a.end());
int mx = 0;
for(int i = 0; i < n; i ++) {
int cursum = 0;
cursum += a[i].second.first;
int curgold = 0;
curgold += a[i].second.second;
mx = max(mx, curgold);
for(int j = i + 1; j < n; j ++) {
curgold += a[j].second.second;
cursum += a[j].second.first;
if(a[j].first - a[i].first <= cursum) {
mx = max(mx, curgold);
}
// cout << cursum << " " << curgold << "\n";
}
}
cout << mx;
return false;
}
