Question
Room Rush

You are given n meetings. Meeting i occupies a room during the half-open interval [start_i,end_i).

A room becomes available immediately at a meeting's end time, so a meeting ending at time t and another starting at time t may use the same room.

Find the minimum number of rooms required so that every meeting can be scheduled.

Input

The first line contains KaTeX can only parse string typed expression.
The next KaTeX can only parse string typed expression lines each contain KaTeX can only parse string typed expression and KaTeX can only parse string typed expression.

Output

Print the minimum number of rooms required.

Example
Input:
3

0 30
5 10
15 20
Output:
2

Online