#include <iostream>
#include <map>
using namespace std;
#define int long long
const int N = 1<<18;
int x[N], p[N], g[N], ft[N], n, Ans, cur;
void Add(int i, int vl){
for (; i; i -= i & -i)
ft[i] = max(ft[i], vl);
}
int get(int i, int Ans = 0){
for (; i < N; i += i & -i)
Ans = max(Ans, ft[i]);
return Ans;
}
map<int,int> mp, mp2;
signed main(){
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
cin>>n;
for (int i=1;i<=n;i++){
cin>>x[i]>>g[i]>>p[i];
g[i] += g[i-1];
p[i] += p[i-1];
mp[p[i] - x[i]];
mp[p[i-1] - x[i]];
}
for (auto [i, j] : mp)
mp2[i] = ++cur;
for (int i=n;i>=1;i--){
int a = mp2[p[i] - x[i]];
int b = mp2[p[i-1] - x[i]];
Add(a, g[i]);
Ans = max(Ans, get(b) - g[i-1]);
}
cout<<Ans<<'\n';
}
