Competitions

# Week 5: December 7 - 13. Integer arrays. Part 2

# Two minimums

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** * `10`

by absolute value.^{9}

#### Output

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

Input example #1

7 2 10 2 3 -1 5 -1

Output example #1

-1 2