Problem Statement

Let ${\rm comb}(n,r)$ be the number of ways to choose $r$ objects from among $n$ objects, disregarding order. From $n$ non-negative integers $a_1, a_2, ..., a_n$, select two numbers $a_i > a_j$ so that ${\rm comb}(a_i,a_j)$ is maximized. If there are multiple pairs that maximize the value, any of them is accepted.

Constraints

• $2 \leq n \leq 10^5$
• $0 \leq a_i \leq 10^9$
• $a_1,a_2,...,a_n$ are pairwise distinct.
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

n
a_1 a_2 ... a_n

Output

Print $a_i$ and $a_j$ that you selected, with a space in between.