We’re preparing your current view and syncing the latest data.
You are given n participants who will attend a contest. Each participant has an arrival time and a departure time. You need to determine the minimum number of tables required such that all participants can have a table at the same time during their attendance.
The first line contains an integer n — the number of participants. The next n lines each contain two integers a_i and b_i — the arrival and departure times of the i-th participant.
Print a single integer — the minimum number of tables required.
1 ≤ n ≤ 10^5 1 ≤ a_i < b_i ≤ 10^9
Example 1
Input
3 1 4 2 5 7 8
Output
2
Explanation
At times 2 and 3, two participants overlap, so at least two tables are needed.