Minimum Possible Value

You are given an array of integers of length \(n\). In this problem, you are required to "perform" \(n-1\) operations so that the array is reduced to a single element. Notice that regardless of the operations performed, the minimum element in the array will always remain in the array. Therefore, the task simply reduces to finding and printing the minimum value in the array.

Note: The operations mentioned in the problem statement do not affect the minimum value of the array. This is why the answer is simply the minimum element.

inputFormat

The input is read from standard input (stdin) and has the following format:

1. The first line contains a single integer \(n\) (1 ≤ n ≤ 10⁵) representing the number of elements in the array.
2. The second line contains \(n\) integers separated by spaces.

outputFormat

Print a single integer, which is the minimum value present in the input array. The output should be written to standard output (stdout).

5
10 20 30 40 50

10