ENG  RUSTimus Online Judge
Online Judge
Online contests
About Online Judge
Frequently asked questions
Site news
Problem set
Submit solution
Judge status
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests

Open Ural FU Championship 2012

About     Problems     Submit solution     Judge status     Standings
Contest is over

A. Excellent Team

Time limit: 1.0 second
Memory limit: 64 MB
Gibbs: Next!
First Pirate: My wife ran off with my dog and I'm drunk for a month.
Gibbs: Perfect. Next!
Second Pirate: Me have one arm and a bum leg.
Gibbs: It's the crow's nest for you. Next!
In Tortuga the Captain Jack Sparrow and Will Turner set up an excellent team. And now Jack wants to elect a captain's mate — the most worthy pirate in the new crew, who has fewer disadvantages and can be a role model for the rest.
Without thinking a lot Jack decided to use the following uncomplicated plan to choose the best pirate of the crew. Firstly, he ranks n contenders in one long row, beckons the first one and this first pirate is a current contender to be the mate. Then Jack walks along the row and stares at everybody one by one. He compares the regular pirate with the current contender and if he sees that the regular pirate has fewer disadvantages, then he changes the current contendor to the regular pirate. In the end of this process the new mate will stand near Jack.
Will knows about Jack’s plan and wants to count what pirate will have most comparisons while Jack elects. Let’s help Will with his calculations.


The first line contains an integer n that is the number of pirates in the crew (1 ≤ n ≤ 105). Next line contains n integers: a1, a2, …, an, where ai is the number of disadvantages of i-th contender in Jack's opinion (1 ≤ ai ≤ 109). The pirates are numbered in the way they stood in the row in the beginning of the elections. It is guaranteed that the numbers of disadvantages, which the pirates have, are pairwise different.


Output the number of a pirate who was compared with others maximal number of times. If there are several such pirates, you can output any of them.


2 5 3 4 1 9
Problem Author: Olga Soboleva
Problem Source: Open Ural FU Championship 2012
To submit the solution for this problem go to the Problem set: 1931. Excellent Team