### F - Fundraising

##### Time & Memory limits:(details)

A prestigious politician aiming for presidency next year is planning a fundraising dinner for her campaign. She has a list of some wealthy people in the country and wants to invite them in a way that the amount of money raised is as great as possible.

Sometimes wealthy people have futile behavior and don’t like the idea that someone richer or prettier than them exists. Every time someone like this meets another person who is strictly prettier, but not strictly richer, then an argument ensues. Likewise, if they meet another person who is strictly richer, but not strictly prettier, an argument occurs as well. These two situations are the only possible causes of an argument involving two persons. Thus, two persons do not have an argument if one of them is strictly prettier and strictly richer than the other. Also, two persons do not have an argument if they are equally rich and equally pretty.

Since the presidential candidate wants to raise as much money as possible, an argument should be avoided at all costs, as it could ruin the campaign. Given the characteristics of some wealthy people in the country, you must find a guest list that maximizes the donations while ensuring that no argument will happen during the dinner.

#### Input

The first line contains an integer $N$ ($1 \leq N \leq 10^5$) representing the number of possible guests with known characteristics. Each of the next $N$ lines describes a possible guest with three integers $B$, $F$ and $D$ ($1 \leq B, F, D \leq 10^9$), indicating respectively the person’s beauty, his/her fortune, and how much this person will donate if invited.

#### Output

Output a single line with an integer indicating the maximum sum of donations if guests are invited so that no argument will happen during the dinner.

#### Sample test(s)

Input
4 1 2 50 2 1 50 2 2 30 1 1 30
Output
60
Input
3 3 3 3 5 5 3 2 2 3
Output
9
Input
3 2 8 13 1 4 12 2 1 16
Output
25