At the moonlit lagoon of Selene, Marek records each barrels in a worn leather ledger. The guild wants answers, not guesses. Task: Read n integers and print the 1-based index of the first occurrence of the maximum value. Input format: First line: n. Second line: n space-separated integers. Output format: Print the 1-based index of the first maximum. Constraints: 1 <= n <= 709; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 709; 0 <= a[i] <= 1000; answers fit a signed 64-bit integer.
