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 a1, a2, ..., ak the element ai is a record if for every integer j (1 ≤ j < i) the following holds: aj < ai. 

Input

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

The second line contains n integers p1, p2, ..., pn (1 ≤ pi ≤ 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.

Examples

Input

1
1


Output

1


Input

5
5 1 2 3 4


Output

5

Note

In the first example the only element can be removed.
import sys

n = int(sys.stdin.readline())
data = sys.stdin.readline().split(" ")
a = [int(x) for x in data]

if (n == 1):
    print(1)
    sys.exit()

pos = [0 for i in range(n + 1)]
for i in range(n):
    pos[a[i]] = i

record = [0 for i in range(n)]
gainWhenRemoved = [0 for i in range(n)]

max1 = -1
max2 = -1

for i in range(n):
    if (a[i] > max1):
        record[i] = 1
    else:
        if (max2 == -1 or max2 < a[i]):
            max1pos = pos[max1]
            gainWhenRemoved [max1pos] = gainWhenRemoved [max1pos] + 1

    if (a[i] > max1):
        max2 = max1
        max1 = a[i]
    else:
        if (a[i] > max2):
            max2 = a[i]

numRecord = sum(record)

sol = -1
index = 0;
for i in range(n):
    tmp = numRecord - record [i] + gainWhenRemoved [i]
    if (sol < tmp) or (sol == tmp and a[index] > a[i]):
        sol = tmp
        index = i

print(a[index])