The council of the terraced vines of Grapehollow pays by the answer, and Tracker intends to earn it. First: the full register of coins. Task: Read n integers and print the smallest value. Input format: First line: n. Second line: n space-separated integers. Output format: Print the minimum value. Constraints: 1 <= n <= 576; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 576; -100 <= a[i] <= 10; answers fit a signed 64-bit integer.
