#200203. [USACO1.2] Milking Cows

Three farmers rise at 5 am each morning and head for the barn to milk three cows. The first farmer begins milking his cow at time (measured in seconds after 5 am) and ends at time . The second farmer begins at time and ends at time . The third farmer begins at time and ends at time . The longest continuous time during which at least one farmer was milking a cow was seconds (from to ). The longest time no milking was done, between the beginning and the ending of all milking, was seconds ( minus ).

Your job is to write a program that will examine a list of beginning and ending times for farmers () milking cows and compute, in seconds:

• The longest time interval at least one cow was milked.
• The longest time interval after milking starts during which no cows were being milked.

Note: Milking from time through , then from time through counts as two different time intervals.

• Line 1: The single integer .
• Lines 2..: Two non-negative integers less than , respectively the starting and ending time in seconds after 05:00.

A single line with two integers that represent the longest continuous time of milking and the longest idle time.

样例输入 1

3
300 1000
700 1200
1500 2100

样例输出 1

900 300

USACO Training Section .