P. N-day Long Event
time limit per test
2 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

This problem is supposed to be the easiest one in KUPC2025. It was removed when the contest was ported to Universal Cup.

An event was held over $$$N$$$ days, and the number of participants on day $$$i$$$ was $$$A_i$$$.

On which day was the number of participants the largest, and how many participants were there on that day?

It is guaranteed that the numbers of participants on different days are all distinct.

Input

The first line contains an integer $$$N$$$. ( $$$1 \leq N \leq 10^5$$$ )

The second line contains $$$N$$$ integers $$$A_1,A_2,\dots,A_N$$$ in this order, separated by spaces. ( $$$1\leq A_i\leq 10^9, i \neq j \Rightarrow A_i \neq A_j$$$ )

Output

Let the day with the largest number of participants be day $$$k$$$. Print $$$k$$$ and $$$A_k$$$ on one line, separated by a space.

Examples
Input
4
1 2 4 3
Output
3 4
Input
9
31 4 15 9 26 5 35 89 7
Output
8 89
Input
1
100
Output
1 100
Note

For the third example, the event may be held for only one day.