Problem Statement

Peak Renewal Window Overlap Each contract is active on every integer day from its start day through its end day, inclusive. Find the largest number of simultaneously active contracts and the earliest day attaining that number. Input Format The first line contains `N`. Each of the next `N` lines contains `start end`. Output Format Print the maximum overlap and its earliest day. Constraints `1 <= N <= 200000`; `1 <= start <= end <= 10^9`.