import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop, core.thread;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) throw new EOFException; tokens = readln.split; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable LIM = 10^^4 + 10;

int N;
Tuple!(int, "w", int, "s", long, "v")[] T;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      T.length = N;
      foreach (i; 0 .. N) {
        T[i].w = readInt();
        T[i].s = readInt();
        T[i].v = readLong();
      }
      T.sort!((a, b) => (a.w + a.s < b.w + b.s));
      debug {
        writeln(T);
      }
      auto dp = new long[LIM + 1];
      dp[] = 0;
      foreach (i; 0 .. N) {
        foreach_reverse (x; 0 .. T[i].s + 1) {
          const xx = min(x + T[i].w, LIM);
          chmax(dp[xx], dp[x] + T[i].v);
        }
      }
      long ans;
      foreach (x; 0 .. LIM + 1) {
        chmax(ans, dp[x]);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}
