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

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.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

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)); }


void update(long[] bit, int pos, long val) {
  for (int x = pos; x < bit.length; x |= x + 1) {
    chmax(bit[x], val);
  }
}
long rangeMax(long[] bit, int pos) {
  long ret;
  for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) {
    chmax(ret, bit[x]);
  }
  return ret;
}


int N;
Tuple!(long, "a", long, "b", long, "c")[] C;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      C.length = N;
      foreach (i; 0 .. N) {
        C[i].a = readLong();
        C[i].b = readLong();
        C[i].c = readLong();
      }
      
      C.sort!((c0, c1) => ((c0.a != c1.a) ? (c0.a < c1.a) : (c0.b > c1.b)));
      auto bs = new long[N];
      foreach (i; 0 .. N) {
        bs[i] = C[i].b;
      }
      bs = bs.sort.uniq.array;
      auto bit = new long[bs.length];
      foreach (i; 0 .. N) {
        const pos = bs.lowerBound(C[i].b);
        const x = C[i].c + bit.rangeMax(pos);
        bit.update(pos, x);
      }
      const ans = bit.rangeMax(cast(int)(bit.length));
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}