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.
#Abhigyan Khaund - syl
n = int(raw_input())
a = map(int, raw_input().split())

cnt = []

m = -1
for i in a:
    if(i>m):
        cnt.append(-1)
        m = i
    else:
        cnt.append(0)
largest = -1
sec = -1
m = []
sm = []

for i in range(n):
    if(largest==-1 and sec==-1):
        m.append(-1)
        sm.append(-1)
        largest = i
        # sec= i
        continue
    if(sec==-1):
        m.append(largest)
        sm.append(-1)
        if(a[i]>a[largest]):
            sec = largest
            largest = i  
            continue
        else:
            sec = i
            continue
    m.append(largest)
    sm.append(sec)
    if(a[i]>a[largest]):
        sec = largest
        largest = i  
        continue
    if(a[i]>a[sec]):
        sec = i  

for i in range(n):
    if(m[i]==-1 and sm[i]==-1):
        continue
    if(sm[i]==-1):
        if(a[m[i]]>a[i]):
            cnt[m[i]]+=1
        continue
    if(a[m[i]]>a[i] and a[sm[i]]<a[i]):
        cnt[m[i]]+=1
        continue

m = max(cnt)
ans = []
for i in range(n):
    if(cnt[i]==m):
        ans.append(a[i])
ans.sort()
print ans[0]
