import java.util.*;
import java.io.*;

public class Main {
	public static void main (String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		Cake[] cakes = new Cake[n];
		for (int i = 0; i < n; i++) {
		    cakes[i] = new Cake(br.readLine());
		}
		Arrays.sort(cakes);
		Cake.doCompress();
		int size = 1;
		long max = 0;
		BinaryIndexedTree bit = new BinaryIndexedTree(Cake.size);
		for (Cake c : cakes) {
		    int idx = c.getIdx();
		    long next = bit.getMax(idx - 1) + c.cal;
		    max = Math.max(max, next);
		    bit.set(idx, next);
		}
		System.out.println(max);
	}
	
	static class Cake implements Comparable<Cake> {
	    static int size = 1;
	    static TreeMap<Integer, Integer> compress = new TreeMap<>();
	    static void doCompress() {
    		for (int x : compress.keySet()) {
    		    compress.put(x, size);
    		    size++;
    		}
	    }
	    
	    int width;
	    int height;
	    int cal;
	    
	    public Cake(int width, int height, int cal) {
	        this.width = width;
	        this.height = height;
	        this.cal = cal;
	        compress.put(height, Integer.MAX_VALUE);
	    }
	    
	    public Cake(String line) {
	        this(line.split(" ", 3));
	    }
	    
	    public Cake(String[] element) {
	        this(Integer.parseInt(element[0]), Integer.parseInt(element[1]), Integer.parseInt(element[2]));
	    }
	    
	    public int getIdx() {
	        return compress.get(height);
	    }
	    
	    public int compareTo(Cake another) {
	        if (width == another.width) {
	            return another.height - height;
	        } else {
	            return width - another.width;
	        }
	    }
	}
}

class BinaryIndexedTree {
    int size;
    long[] tree;
    
    public BinaryIndexedTree(int size) {
        this.size = size;
        tree = new long[size];
    }
    
    public void set(int idx, long value) {
        int mask = 1;
        while (idx < size) {
            if ((idx & mask) != 0) {
                tree[idx] = Math.max(tree[idx], value);
                idx += mask;
            }
            mask <<= 1;
        }
    }
    
    public long getMax(int x) {
        int mask = 1;
        long ans = 0;
        while (x > 0) {
            if ((x & mask) != 0) {
                ans = Math.max(ans, tree[x]);
                x -= mask;
            }
            mask <<= 1;
        }
        return ans;
    }
}