#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>using namespace std;const int N = 50000 + 10;int dp[N];
int s[N], x[N], y[N];
int n;struct node
{int l, r, maxx;
}p[N * 3];void build(int s, int t, int k)
{p[k].l = s, p[k].r = t;p[k].maxx = 0;if( s == t )return ;int kl = k << 1, kr = kl + 1, mid = (s + t) >> 1;build(s, mid, kl);build(mid + 1, t, kr);
}void update(int k, int s, int val)
{if(s == p[k].l && p[k].r == p[k].l){p[k].maxx = val;return ;}int kl = k << 1, kr = kl + 1, mid = (p[k].l + p[k].r) >> 1;if( s <= mid ) update(kl, s, val);else update(kr, s, val);p[k].maxx = max(p[kl].maxx, p[kr].maxx);
}int query(int s, int t, int k)
{if( s <= p[k].l && t >= p[k].r){return p[k].maxx;}int mid = (p[k].l + p[k].r) >> 1;int kl = k << 1, kr = kl + 1;int a = 0, b = 0;if(s <= mid) a = query(s, t, kl);if(t > mid) b = query(s, t, kr);return max(a, b);
}int main()
{while(scanf("%d",&n) == 1){for(int i = 1; i <= n; ++i)scanf("%d %d %d",&s[i], &x[i], &y[i]);build(1, n, 1);update(1, n, s[n]);int ans = 0;for(int i = n - 1; i >= 1; --i){int l = i + x[i];int r = i + y[i] - 1;r = min(r, n);int val = s[i] + query(l, r, 1);update(1, i, val);if(i == 1) ans = val;}printf("%d\n",ans);}return 0;
}