Find two different minimal elements in the given sequence of numbers.

Input

First line contains the number of elements n (3 ≤ n ≤ 1000) in the sequence. Then given n integers, each of them is no more than 2 * 109 by absolute value.

Output

Print in increasing order two different minimal elements from the given sequence. It is known that they always exist.