#t33. 找最小值
找最小值
Find the Minimum
Problem Description
Given n and n integers a_i, find the minimum among these n integers.
Input Format
The first line contains a positive integer n, the number of values.
The second line contains n non-negative integers, a_1, a_2, …, a_n, separated by spaces.
Output Format
Output one non-negative integer: the minimum among these n non-negative integers.
Sample Input
5
5 7 4 2 6
Sample Output
2
Constraints
It is guaranteed that 1 ≤ n ≤ 100, 0 ≤ a_i ≤ 1000.