Baron runs the print shop at the cedar groves of Balmcrest. Today the books show a list of stamps, and the numbers must be worked out before sundown. Task: Read n integers and print the first value that appears twice (the value whose second occurrence has the smallest index). If all are distinct print -1. Input format: First line: n. Second line: n space-separated integers. Output format: Print the first repeated value, or -1. Constraints: 1 <= n <= 588; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 588; -100 <= a[i] <= 1000; answers fit a signed 64-bit integer.
