Find the Highest Card Position

You are given n cards arranged in a row. Each card has an integer value. Your task is to find the position of the card with the highest value. If there are multiple cards with the highest value, output the position of the first one (i.e., the smallest index).

Note that the problem uses 1-indexed positions. Also, the number of cards n satisfies the condition \(1\le n \le 1000\).

inputFormat

The first line of the input contains an integer n representing the number of cards. The second line contains n space-separated integers, where each integer is the value on a card.

For example:

5
3 6 2 8 5

outputFormat

Output a single integer which is the 1-indexed position of the card with the highest value. In case of a tie, output the smallest position among them.

## sample

5
3 6 2 8 5

4

</p>