import sys
input = sys.stdin.readline
from copy import *
from bisect import *

def compress(lst):
    """
    B: lstを座圧したリスト
    D: indexから元の値を取得する辞書
    """
    B = []
    D = dict()
    vals = deepcopy(lst)
    vals = list(set(vals))
    vals.sort()
    for i in range(len(lst)):
        ind = bisect_left(vals, lst[i])
        B.append(ind)
    for i in range(len(B)):
        D[lst[i]] = B[i]
    return B, D, vals

class SegmentTree:
    def __init__(self, size, f=max, default=0):
        self.size = 2**(size-1).bit_length() 
        self.default = default
        self.dat = [default]*(self.size*2) 
        self.f = f

    def update(self, i, x):
        i += self.size
        self.dat[i] = x
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])

    def query(self, l, r):
        l += self.size
        r += self.size
        lres, rres = self.default, self.default
        while l < r:
            if l & 1:
                lres = self.f(lres, self.dat[l])
                l += 1

            if r & 1:
                r -= 1
                rres = self.f(self.dat[r], rres) 
            l >>= 1
            r >>= 1
        res = self.f(lres, rres)
        return res

N = int(input())
A, B, C = [0] * N, [0] * N, [0] * N
for i in range(N):
    A[i], B[i], C[i] = map(int, input().split())

A, _, _ = compress(A)
B, _, _ = compress(B)
D = []
for i in range(N):
    D.append((A[i], -B[i], C[i]))

D.sort()
T = SegmentTree(N + 5)
for a, b, c in D:
    b = -b
    v = T.query(0, b) + c
    v = max(v, T.query(b, b + 1))
    T.update(b, v)

print(T.query(0, N + 5))