Remove Extra One

2000ms

262144K

Description:

You are given a permutation p of length n. Remove one element from permutation to make the number of records the maximum possible.

We remind that in a sequence of numbers a₁, a₂, ..., a_k the element a_i is a record if for every integer j (1 ≤ j < i) the following holds: a_j < a_i.

Input:

The first line contains the only integer n (1 ≤ n ≤ 10⁵) — the length of the permutation.

The second line contains n integers p₁, p₂, ..., p_n (1 ≤ p_i ≤ n) — the permutation. All the integers are distinct.

Output:

Print the only integer — the element that should be removed to make the number of records the maximum possible. If there are multiple such elements, print the smallest one.

Sample Input:

1
1

Sample Output:

Sample Input:

5
5 1 2 3 4

Sample Output:

Note:

In the first example the only element can be removed.

Informação

Provedor Codeforces

Código CF900C