Problem Description

Rar the Cat is quite forever alone, truthfully, that is, before he found his lifelong partner Mr Panda. Mr Panda loves eating bamboo, and one day he ran off from the embrace of Rar the Cat into the forest in search for a new source of bamboo. After Rar the Cat's tireless efforts of finding him back, he finally got N pandas from the bamboo forest. However, due to his horrendous memory, he has no way of remembering which was Mr Panda! He lines every panda in front of him in a straight line, and labels them from 1 to N. Each of them is carrying a bamboo stick of length Li, which they were still eating when Rar the Cat abducted them. Since Mr Panda is a VERY VERY greedy panda, his bamboo stick would have been the longest. Help Rar the Cat find the label in which Mr Panda is at. If there are more than one panda with the stick of the same longest length, output "MMMMMEEEEOOOOOWWWW!!!!!" as Rar the Cat would go crazy after failing to find his dear husband and finding out that his dear husband is not actually Mr Panda.

Input

The input contains two lines. The first line would contain one integer, N, indicating the number of pandas Rar the Cat returned with.
The second line would contain N integers separated by a space in between two integers, with the ith number indicating the length of the bamboo stick the ith panda is holding.
The input will be terminated with a newline.

Output

Your output should contain one integer, the position in which Mr Panda is in. Your output should end with a newline.

Limits

1 <= N <= 1,000,000
1 <= Li <= 1,000,000,000

Sample Input 1

6
1 2 3 4 5 6

Sample Output 1

6

Sample Input 2

6
1 2 3 4 5 5

Sample Output 2

MMMMMEEEEOOOOOWWWW!!!!!