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*_{1}, *a*_{2}, ..., *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^{5}$) — the length of the permutation.

The second line contains $*n*$ integers $*p*_{1}, *p*_{2}, ..., *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.

Note

In the first example the only element can be removed.