PROGRAMMING:Hero position (maximum position)
A sequence of numbers in a row, to choose the largest number as the number of heroes in the sequence, now, know that a sequence, a total of N numbers, the number of each number know, ask you to choose the position of the largest number in the sequence (note, if there are multiple largest numbers in the sequence, choose the last largest number).
###Input format:
Enter the number of people n from the keyboard, and then enter n integer (- 2000 < = n < = 30000).
###Output format:
Calculates the position of the last largest number and outputs it from the screen.
###Input example:
Here is a set of inputs. For example:
```in
5 3 8 5 8 7
```
###Output example:
The corresponding output is given here. For example:
```out
four
```
answer：If there is no answer, please comment
###Input format:
Enter the number of people n from the keyboard, and then enter n integer (- 2000 < = n < = 30000).
###Output format:
Calculates the position of the last largest number and outputs it from the screen.
###Input example:
Here is a set of inputs. For example:
```in
5 3 8 5 8 7
```
###Output example:
The corresponding output is given here. For example:
```out
four
```
answer：If there is no answer, please comment