Eddy is looking for a tree to buy for the holidays, but he knows that a lot of the $N$ tree suppliers near him are trying to scam him for his money. As such, he forced Max to find the price of the cheapest tree. Max has compiled a list of all $N$ prices, which are integers from $1$ to $100$ inclusive, but he's too tired to find the cheapest tree and instead forces this task onto you. Don't let him down!

Constraints

$1\le N\le {10}^6$

Input Specification

The first line contains a single integer $N$.

The second line contains $N$ space-separated integers from 1 to 100, the list of prices.

Output Specification

Output a single integer, the minimum price in the list.

Sample Input

5
4 3 7 1 100

Sample Output

1