#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
int main() {
int n;cin>>n;
vector<ll> x(n+1),g(n+1),e(n+1);
x[0]=0;e[0]=0;g[0]=0;
REP(i,1,n+1){
cin>>x[i]>>g[i]>>e[i];
g[i]+=g[i-1];
e[i]+=e[i-1];
}
priority_queue<pair<ll,int>> pq;
REP(i,1,n+1)pq.push({e[i]-x[i],i});
ll ans=0;
REP(i,1,n+1){
while(!pq.empty()){
ll a=pq.top().F;
int b=pq.top().S;
if(a+x[i]-e[i-1]<0)break;
pq.pop();
ans=max(ans,g[b]-g[i-1]);
}
}
cout<<ans;
}
