#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
const int N = 1e6+12,INF=1e9+7;
int p[N],der[N],g[N],x[N];
void update(int v,int l,int r,int pos,int x){
if (l == r)der[v] = x;
else {
int m = l+r>>1;
if (pos > m){
update((v<<1)+1,m+1,r,pos,x);
}
else update(v<<1,l,m,pos,x);
der[v] = max(der[v<<1],der[(v<<1)+1]);
}
}
int get_ans(int v,int l,int r,int x){
if (l == r)ret l;
int m = l+r>>1;
int a = der[v<<1];
int b = der[(v<<1)+1];
if (x <= b)ret get_ans((v<<1)+1,m+1,r,x);
else ret get_ans(v<<1,l,m,x);
}
main(){
int n,i,j,ans=0;
cin>>n;
for (i=1;i<=n;++i){
int b,c;
cin>>x[i]>>b>>c;
p[i] = p[i-1]+c;
g[i] = g[i-1]+b;
update(1,1,n,i,p[i]-x[i]);
}
for (i=1;i<=n;++i){
int j = get_ans(1,1,n,p[i-1]-x[i]);
ans = max(ans,g[j]-g[i-1]);
}
cout <<ans;
}
