## MOG Round #1## Ended |

In a long classroom, $N$ desks are arranged in a single row, with two students sitting at each desk.

Students are cranky because they are about to have an art class, and their professor is planning to examine them. Each student has studied art, but only to a certain level. The old professor can tell by the looks on their faces just how much they have studied. The professor, being an artist, uses a different coloured pencil for each grade. Unfortunately, today he brought only one pencil.

In order to make the examination seem fair, he wants to choose two desks and question one student from each desk positioned between the two desks he has chosen (including the chosen desks). It is important that all examined students deserve the same grades, so he can write them down using his only pencil.

The professor wants to know the maximum number of students he can examine this way, as well as which grade the students will get.

The first line of input contains a single integer $N$ $(1 \leq N \leq 100000)$. Each of the following $N$ rows contains two integers: $A_i$ and $B_i$, grades deserved by students sitting at desk $i$ $(1 \leq A_i, B_i \leq 5)$.

The first and only line of output must contain two numbers separated by a single space: the maximum number of students the professor can examine and the grade those students will get. If there are multiple solutions possible, output the one with the smallest grade.

Input

1
1 5

Output

1 1

Input

3
3 5
4 5
1 3

Output

2 5

Input

4
2 1
3 2
5 3
2 5

Output

2 2