#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <unistd.h>

struct P {
    int a, b, c;
};

int n;
struct P a[200000];
long long bit[200001];

long long max(long long x, long long y) {
    return x > y ? x : y;
}

bool cmp(struct P x, struct P y) {
    if (x.a != y.a) return x.a < y.a;
    return x.b > y.b;
}

bool cmpb(struct P x, struct P y) {
    return x.b < y.b;
}

void update(int k, long long v) {
    for (int i = k + 1; i <= 200000 && bit[i] < v; i += i & -i) {
        bit[i] = v;
    }
}

long long query(int k) {
    long long res = 0;
    for (int i = k; i > 0; i -= i & -i) {
        res = max(res, bit[i]);
    }
    return res;
}

char buf[200000 * 33 + 100];
int k = 0;

int i32() {
    int res = 0;
    while (buf[k] < '0') k++;
    while (buf[k] >= '0') {
        res = res * 10 + (buf[k] - '0');
        k++;
    }
    return res;
}

int main() {
    read(STDIN_FILENO, buf, sizeof(buf));
    int n = i32();
    for (int i = 0; i < n; i++) {
        a[i].a = i32();
        a[i].b = i32();
        a[i].c = i32();
    }
    std::sort(a, a + n, cmpb);
    {
        int k = -1;
        int p = -1;
        for (int i = 0; i < n; i++) {
            k += p != a[i].b;
            p = a[i].b;
            a[i].b = k;
        }
    }
    std::sort(a, a + n, cmp);
    for (int i = 0; i < n; i++) {
        update(a[i].b, query(a[i].b) + a[i].c);
    }
    printf("%lld\n", query(200000));
}