B. The First Case
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Young Sherlock Holmes has just received his first official data set from Scotland Yard. It is a simple chronological record of $$$n$$$ crime reports from various districts in London.

To challenge himself, Sherlock decides he will only investigate the district with the highest number of reported crimes. If there are multiple districts with the same maximum number of crimes, Sherlock, being a man of efficiency, will choose the one that appeared earliest in the records.

Input

The first line contains an integer $$$n$$$ ($$$1 \le n \le 10^5$$$) — the number of districts recorded.

The second line contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ ($$$0 \le a_i \le 10^9$$$) — the number of crimes in each district.

Output

Output a single integer — the 1-based index of the first district that contains the maximum number of crimes.

Example
Input
5
10 20 50 40 50
Output
3