# include <bits/stdc++.h>
#define f first
#define s second
#define int long long
#define pb push_back
using namespace std;
const int N = 3e5 + 5;
int n,x[N],g[N],d[N],pr[N],pr1[N];
int tree[4*N],val,dist,ans,idx;
void build(int node,int le, int ri) {
if (le == ri) {
tree[node] = pr[le];
return ;
}
int mid = (le + ri) / 2;
build(2*node,le,mid);
build(2 * node + 1, mid + 1, ri);
tree[node] = max(tree[2*node], tree[2*node + 1]);
}
int getans(int node, int le, int ri, int start,int end, int val) {
if (le > end || ri < start) return 0;
int mid = (le + ri) / 2;
if (le >= start && ri <= end) {
if (tree[node] < val) return 0;
if (le == ri) {
return le;
}
if (tree[2*node + 1] >= val) return getans(2*node + 1, mid + 1, ri, start,end,val);
else return getans(2*node, le,mid, start,end,val);
}
return max(getans(2*node,le,mid,start,end,val), getans(2*node + 1,mid + 1, ri, start,end,val));
}
main() {
std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
cin>>n;
for (int i = 1; i <= n; i++) {
cin>>x[i]>>g[i]>>d[i];
if (i > 1) {
dist = (x[i] - x[i - 1]);
pr[i] = pr[i - 1] + d[i] - dist;
// update(1,1,n,i, pr[i]);
}
ans = max(ans,g[i]);
pr1[i] = pr1[i - 1] + g[i];
}
build(1,1,n);
for (int i = 1; i <= n; i++) {
// pr[j] - pr[i] + d[i] >= 0 pr[j] >= pr[i] - d[i]
val = pr[i] - d[i];
// i + 1-----> n >= val
idx = getans(1,1,n,i + 1, n, val);
if (idx == 0) {
continue;
}
ans = max(ans, pr1[idx] - pr1[i - 1]);
}cout<<ans<<endl;
}
