Task Assignment

Problem Description

You have $n$ tasks. The $i$-th task starts at time $s_i$ and ends at time $e_i$; if you do it, you get a profit of $w_i$.

But you can do at most one task at any moment. Choose which tasks to do so that your total profit is maximized.

Note that it is allowed to start the next task immediately after the previous one ends.

Input Format

The first line contains an integer $n$.

The next $n$ lines each contain three integers $s_i, e_i, w_i$.

Output Format

Output one number: the answer.

Sample Input

3
1 3 100
2 4 199
3 5 100

Sample Output

200

Constraints

For all data, $1 \le n \le 10^3$, $1 \le s_i < e_i \le 10^3$, and $1 \le w_i \le 10^5$.