#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////

vvmint mul(vvmint a, vvmint b, ll N) {
	vvmint ret(N, vmint(N, 0));
	rep(i, N)rep(j, N)rep(k, N) {
		ret[i][j] += a[i][k] * b[k][j];
	}

	return ret;
}

vvmint pow(vvmint a, ll N, ll K) {
	if (K == 0) {
		vvmint ret(N, vmint(N, 0));
		rep(i, N) ret[i][i] = 1;
		return ret;
	}

	vvmint X = pow(a, N, K/2);

	if (K % 2 == 1) {
		return mul(a, mul(X, X, N), N);
	}

	return mul(X, X, N);
}


int main() {
	ll N;
	cin >> N;

	vector < pair<pair<ll, ll>, pair<ll, ll>>> p(N + 1);
	repn(i, N) {
		ll w, s, v;
		cin >> w >> s >> v;
		p[i].first.first = w + s;
		p[i].first.second = w;
		p[i].second.first = s;
		p[i].second.second = v;
	}

	sort(++p.begin(), p.end());

	vll w(N + 1), s(N + 1), v(N + 1);
	repn(i, N) {
		w[i] = p[i].first.second;
		s[i] = p[i].second.first;
		v[i] = p[i].second.second;
	}

	ll M = 30000;

	vvll dp(N + 1, vll(M + 1, -1));
	dp[0][0] = 0;

	repn(i, N)rep(j, M + 1) {
		dp[i][j] = dp[i - 1][j];
		if (s[i] >= j - w[i] && j - w[i] >= 0) {
			if (dp[i - 1][j - w[i]] == -1) { continue; }
			dp[i][j] = max(dp[i][j], dp[i - 1][j - w[i]] + v[i]);
		}
	}

	ll ans = 0;
	rep(i, M + 1)ans = max(ans, dp[N][i]);
	cout << ans << endl;
}



Measured memory_bytes: 239724