#include <iostream>
#include <iomanip>
#include <algorithm>
#include <bitset>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cmath>
#include <time.h>
#include <random>
#include <string>
#include <cassert>
#include <vector>
#include <ostream>
#include <istream>
#include <stack>
#include <deque>
#include <queue>
#include <functional>
#include <chrono>
#include <stack>
using namespace std;
#define int long long
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double
ostream& operator<< (ostream &out, const vector<int> &b) {
for (auto k : b) out << k << " ";
return out;
}
istream& operator>> (istream& in, pii& b) {
in >> b.first >> b.second;
return in;
}
ostream& operator<< (ostream& out, const pii& b) {
out << "{" << b.first << ", " << b.second << "}";
return out;
}
template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}
#ifdef LOCAL
#define dbg(x) cout << #x << " : " << (x) << endl;
const int INF = 1e18;
// const int mod = 2600000069;
// const int p = 10;
#else
#define dbg(x) 57
const int INF = 1e18;
// const int mod = 2600000069;
// const int p = 179;
#endif
const ld PI = 4 * atan(1);
#define time clock() / (double) CLOCKS_PER_SEC
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")
// #pragma GCC optimize("section-anchors")
// #pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
// #pragma GCC optimize("vpt")
// #pragma GCC optimize("rename-registers")
// #pragma GCC optimize("move-loop-invariants")
// #pragma GCC optimize("unswitch-loops")
// #pragma GCC optimize("function-sections")
// #pragma GCC optimize("data-sections")
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
const int MAXN = 1e5 + 10;
int n;
int x[MAXN], g[MAXN], e[MAXN];
int pref[MAXN];
pii t[4 * MAXN];
pii merge(const pii& a, const pii& b) {
pii c = a;
if (b.first > c.first) c = b;
return c;
}
void build(int v, int l, int r) {
if (l + 1 == r) {
t[v] = {INF, l};
return;
}
int m = (l + r) / 2;
build(2 * v + 1, l, m);
build(2 * v + 2, m, r);
t[v] = merge(t[2 * v + 1], t[2 * v + 2]);
}
void update(int v, int l, int r, int pos, int val) {
if (l + 1 == r) {
t[v] = {val, l};
return;
}
int m = (l + r) / 2;
if (pos < m) update(2 * v + 1, l, m, pos, val);
else update(2 * v + 2, m, r, pos, val);
t[v] = merge(t[2 * v + 1], t[2 * v + 2]);
}
pii ask(int v, int l, int r, int x) {
if (l + 1 == r) {
return t[v];
}
int m = (l + r) / 2;
if (t[2 * v + 1].first >= x) return ask(2 * v + 1, l, m, x);
return ask(2 * v + 2, m, r, x);
}
int ask(int l, int r) {
return pref[r] - (l > 0 ? pref[l - 1] : 0);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
e[MAXN - 1] = INF;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x[i] >> g[i] >> e[i];
}
build(0, 0, n);
for (int i = 0; i < n; i++) {
pref[i] = (i > 0 ? pref[i - 1] : 0) + g[i];
}
int z = 0;
int ans = 0;
for (int i = 0; i < n; i++) {
update(0, 0, n, i, z + e[i]);
pii w = ask(0, 0, n, z);
chkmax(ans, ask(w.second, i));
if (i < n - 1) {
z += x[i + 1] - x[i] - e[i + 1];
}
}
cout << ans << "\n";
}
/*
*/
