#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e5 + 5; int n, l, x[N], g[N], e[N]; ll de[N], dg[N], ans; set < pair < ll, int > > st; int main() { // freopen("divide.in", "r", stdin); // freopen("divide.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; cout << "\n"; for (int i = 1; i <= n; ++i) { cin >> x[i] >> g[i] >> e[i]; dg[i] += dg[i - 1] + g[i]; de[i] += de[i - 1] + e[i]; } for (int r = 1; r <= n; ++r) { for (int l = 1; l <= r; ++l) { if (x[r] - x[l] <= de[r] - de[l - 1] && dg[r] - dg[l - 1] > ans) { ans = dg[r] - dg[l - 1]; break; } } } cout << ans; }