Minimum Value

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

Given an integer array $A=(a_0,a_1,\ldots,a_{n-1})$, find its minimum value:

Input

• The first line contains an integer $n$.
• The second line contains $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print one integer, the minimum value $m$.

Subtasks

Subtask 1 (100 points): $1\le n\le10^5$ and $-10^9\le a_i\le10^9$.

Examples

Input

6
7 -3 5 -10 8 -2

Output

-10

Explanation

The smallest value among $7,-3,5,-10,8,-2$ is $-10$, so the program prints -10.