Index of the Maximum Element

Source: C Primer Plus

Version: Phuoc Hung OJ Extended

Problem Statement

Given an integer array $A=(a_0,a_1,\ldots,a_{n-1})$ indexed from $0$ to $n-1$, find the smallest index $p$ such that $a_p$ equals the maximum value of the array. Thus, when the maximum occurs more than once, choose its first occurrence.

Input

• The first line contains an integer $n$.
• The second line contains $n$ integers $a_0,a_1,\ldots,a_{n-1}$.

Output

Print one integer, the $0$-based index $p$ of the first occurrence of the maximum value.

Subtasks

Subtask 1 (100 points): $1\le n\le10^5$ and $-10^9\le a_i\le10^9$.

Examples

Input

7
4 9 2 9 7 1 9

Output

1

Explanation

The maximum value is $9$, occurring at indices $1,3,6$. The smallest of these indices is $1$, so the answer is 1.