# Week 3: November 23 – 29. For Loop. Part 1

# Watermelons

Ivan Vasilyevich came to the market and decided to buy two watermelons: one for himself and another for the wife's mother. It is clear to choose for himself the heaviest watermelon, and for mother-in-law the lightest. But there is one problem: there are many watermelons and he does not know how to choose the lightest and the heaviest one. Help him!

#### Input

The first line contains the number of watermelons **n** (**n** ≤ **30000**). The second line contains **n** numbers, each number is a mass of corresponding watermelon. All weights of watermelons are positive integers and do not exceed 30000.

#### Output

Print two numbers: the weight of watermelon that Ivan Vasilyevich will buy for his mother-in-law and the weight of watermelon that he will buy himself, or print the message "**Ooops!**" (without quotes), if someone left without watermelon.

5 5 1 6 5 9

1 9

1 5

Ooops!

2 30000 30000

30000 30000