Challenges

Rotate Array
You are given an array of N length. You have to rotate the array right...
Max. Marks: 6
Solved By : 750
Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 4383
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 3857
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 2045
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 3213
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 3993
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 2759
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 2050
Degree Celsius
Tom is a scientist. He uses huge machines for complex calculations. Th...
Max. Marks: 4
Solved By : 4654
Three's Company
This problem requires you to create a output string from input string ...
Max. Marks: 4
Solved By : 3068
Love For Mathematics
Please select a challenge
Problem Statement
Students of Dcoder school love Mathematics. They love to read a variety of Mathematics books. To make sure they remain happy,their Mathematics teacher decided to get more books for them. A student would become happy if there are at least X Mathematics books in the class and not more than Y books because they know "All work and no play makes Jack a dull boy".The teacher wants to buy a minimum number of books to make the maximum number of students happy.

Input
The first line of input contains an integer N indicating the number of students in the class. This is followed up by N lines where every line contains two integers X and Y respectively.

Output
Output two space-separated integers that denote the minimum number of mathematics books required and the maximum number of happy students. Explanation: The teacher could buy 5 books and keep student 1, 2, 4 and 5 happy.

Constraints
1<=N<=10000 1<=X,Y<=10^9

Sample Input
5
3 6
1 6
7 11
2 15
5 8

Sample Output

5 4

Dcoded By: Bhanu Nadar

Solved By: 556

Maximum Marks: 15