import sys
input = sys.stdin.readline
from collections import defaultdict
 
def compress(l):
    l = list(set(l))
    l.sort()
    idx = defaultdict(int)

    for i in range(len(l)):
        idx[l[i]] = i
    
    return idx

class BIT:
    def __init__(self, n):
        self.n = n
        self.bit = [0]*(n+1)
    
    def update(self, i, x):
        i += 1
        
        while i<=self.n:
            self.bit[i] = max(self.bit[i], x)
            i += i&(-i)

    def acc(self, i):
        s = 0
        
        while i>0:
            s = max(s, self.bit[i])
            i -= i&(-i)
        
        return s

N = int(input())
ABC = [tuple(map(int, input().split())) for _ in range(N)]
ABC.sort(key=lambda t: (t[0], -t[1]))
B = [Bi for _, Bi, _ in ABC]
C = [Ci for _, _, Ci in ABC]
idx = compress(B)
bit = BIT(len(idx.keys()))

for Bi, Ci in zip(B, C):
    i = idx[Bi]
    bit.update(i, bit.acc(i)+Ci)

print(bit.acc(len(idx.keys())))