The council of the archive halls of Scrollkeep pays by the answer, and Wheelwright intends to earn it. First: the full register of stamps. Task: Read n integers and print the second distinct largest value. If every value is the same, print -1. Input format: First line: n. Second line: n space-separated integers. Output format: Print the second distinct maximum, or -1 if none. Constraints: 1 <= n <= 26; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 26; -100 <= a[i] <= 1000000; answers fit a signed 64-bit integer.
