It is audit day at the willow walks of Reedmarsh. Ravi spreads the ingots records across the table and picks up a sharp pencil. Task: Read n integers and print the largest value. Input format: First line: n. Second line: n space-separated integers. Output format: Print the maximum value. Constraints: 1 <= n <= 209; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 209; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.
