#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int oo = 1e9;
int n, a[200001], b[200001], h[200001], ans[200001];
vector<int> ins[400001], rem[400001];
int segtree[800001];
void build(int node = 1, int l = 1, int r = n) {
segtree[node] = -oo;
if (l != r) {
int mid = (l + r) / 2;
build(node * 2, l, mid); build(node * 2 + 1, mid + 1, r);
}
}
void update(int pos, int val, int node = 1, int l = 1, int r = n) {
if (l == r) segtree[node] = val;
else {
int mid = (l + r) / 2;
if (pos > mid) update(pos, val, node * 2 + 1, mid + 1, r);
else update(pos, val, node * 2, l, mid);
segtree[node] = max(segtree[node * 2], segtree[node * 2 + 1]);
}
}
int query(int x, int y, int node = 1, int l = 1, int r = n) {
if (l > y || r < x) return -oo;
if (l >= x && r <= y) return segtree[node];
int mid = (l + r) / 2;
return max(query(x, y, node * 2, l, mid), query(x, y, node * 2 + 1, mid + 1, r));
}
void solve() {
build();
for (int i = 1; i <= n; i++) {
for (int j : ins[i]) update(j, h[j]);
ans[i] = max(ans[i], query(i - b[i], i - a[i]) - h[i]);
for (int j : rem[i]) update(j, -oo);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> h[i] >> a[i] >> b[i];
ins[i + a[i]].push_back(i);
rem[i + b[i]].push_back(i);
}
int q;
cin >> q;
// for (int i = 1; i <= q; i++) {
// cin >> queries[i].first.first >> queries[i].first.second;
// }
if (q == 1) {
memset(ans, -1, sizeof ans);
solve();
for (int i = 1; i <= n; i++) h[i] *= -1;
solve();
cout << *max_element(ans + 1, ans + n + 1);
} else {
cout << "TODO :(";
}
return 0;
}
