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
import random
def main():
    sys.stdin.readline()
    line = sys.stdin.readline()
    hs = map(int,line.split())
    print run(hs)

def run(hs):
    ph = 0
    pph = 0
    best_cnt = 1
    best_h = hs[0]
    cnt = 0
    small = 1000000
    for h in hs:
        if h > ph:
            pph = ph
            ph = h
            cnt = 0
        else:
            if h < small:
                small = h
            if h > pph:
                cnt += 1
                pph = h
                if cnt > best_cnt:
                    best_cnt = cnt
                    best_h = ph
    if best_cnt == 1 and small != 1000000:
        best_h = small
    return best_h
main()
