Sprint C — The Busiest Point (SELF-TIMED 30)

**SELF-TIMED: 30 minutes.** One observation unlocks it; the rest is implementation discipline. **Bài toán.** Given n intervals [l, r] over integer points, find the maximum number of intervals that cover any single point. Print that number. **Constraints:** 1 ≤ n ≤ 200000; 0 ≤ l ≤ r ≤ 10^6. **Input:** line 1: n; then n lines l r. **Output:** one integer — the maximum coverage.