#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <math.h>
#include <array>
#include <random>
#include <bitset>
#include <climits>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define endl '\n'
#define mod 1000000007
#define INF 0x3f3f3f3f
#define int long long
template <class x>
using ordered_set = tree<x, null_type, less<x>, rb_tree_tag, tree_order_statistics_node_update>;
typedef pair<int, int> ipair;
static inline int read()
{
int x = 0;char ch = getchar();
while (ch < '0' || ch>'9') ch = getchar();
while (ch >= '0' && ch <= '9') x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return x;
}
static inline void print(const int &x) {
if (x > 9) print(x / 10);
putchar('0' + x % 10);
}
signed main()
{
cin.tie(0) -> sync_with_stdio(0);
int n;
cin >> n;
array<int, 3> list[n];
for(int i = 0;i < n;i++) cin >> list[i][0] >> list[i][1] >> list[i][2];
int ans = 0;
for(int l = 0;l < min(10ll, n);l++)
{
int eng = 0, sum = 0;
for(int r = l;r < n;r++)
{
eng += list[r][2];
sum += list[r][1];
if(list[r][0] - list[l][0] <= eng) ans = max(ans, sum);
}
}
cout << ans;
}
