e-olymp
Competitions

Quick Start C: Loops, Arrays, Functions

Two minimums

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

Input

First line contains the number of elements n (3n1000) 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.

Time limit 1 second
Memory limit 128 MiB
Input example #1
7
2 10 2 3 -1 5 -1
Output example #1
-1 2