First Maximum Index

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given an integer array $a$ of length $n$, indexed from $0$ to $n-1$. Let $M=\max_{0\le i<n}a_i$. Find

Thus, ties for the maximum must be resolved by choosing its first occurrence.

Input

• Line 1: integer $n$.
• Line 2: $n$ integers $a_0,\ldots,a_{n-1}$.

Output

Print the 0-based index $p$.

Subtask

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

Example

Input

7
3 9 4 9 2 9 1

Output

1

Explanation

The maximum $9$ occurs at indices $1,3,5$; the first is $1$.