\problemname{Live aid}
\illustration{.3}{pic}{\href{https://unsplash.com/photos/hzgs56Ze49s}{Unsplash License, Photo by Anthony Delanoix via Unsplash}}%
%
You are organizing the annual ``Boost the Global Opulence'' fundraiser concert and have
received an extraordinarily amount of requests from musicians
that want to perform. However, you only have one stage, so you
can not invite all of them. 

Each musician has a certain potential for attention, and
you want to maximize the total attention potential for the concert.

But the musicians are very stubborn. They require that they can
choose when their performance starts and for how long it lasts.
More specifically, all of them have given you a start time and
end time for their performance. If you cannot guarantee this,
they will not perform at all.

\section*{Input}
The first line contains a single integer $1 \leq n \leq 150\,000$, the number of musicians.
Then follows $n$ lines, one for each musician. Each line contains three space-separated integers $s$, $e$ and $a$, where 
$0 \leq s \leq 10^6$ is the start time, $s < e \leq 10^6$ is the end time, and $0 \leq a \leq 10^6$ is the attention potential of the musician.

\section*{Output}
Output the maximum total attention for the concert. In other words,
pick a subset of the musicians to perform on the stage that maximize the sum of their attention potential, subject to the requirements that every musician gets their preferred time slot and there are no overlapping performances.
