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.
n = input()
a = list(map(int, input().split()))

def solve(a):
    flags = [0]* len(a)
    rec_flags = [0]* len(a)


    max1 = 0
    max2 = 0
    id_max1 = -1

    # max1 > max2

    for i in range(len(a)):
        if a[i] < max2:
            pass
        elif a[i] > max1:
            max2 = max1
            max1 = a[i]
            id_max1 = i
            rec_flags[id_max1] += 1

        elif a[i] < max1 and a[i] > max2:
            flags[id_max1] += 1
            max2 = a[i]


    tar = max(flags)



    ans = []
    ans_no_rec = []
    if tar == 1:
        ind = flags.index(1)
        return min(a[ind:])
    else:
        for i in range(len(flags)):
            if flags[i] == tar:
                if rec_flags[i] > 0:
                    ans.append(a[i])
                else:
                    ans_no_rec.append(a[i])

    if ans_no_rec:
        return min(ans_no_rec)
    return min(ans)
    
print(solve(a))