Practice, Seepy

Seepy likes practicing competitive programming. He wants to participate in as many contests as possible. However, some of these contests take place at the same time. Help him find out the maximum number of contests he can participate in. There are $n$ contests taking place, the $i^{th}$ of which may be represented by a pair of integers $l_i$ and $r_i$ representing the start and end times of th