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

mbef = [-1]*n

for i in range(1, n):
  if mbef[i-1] == -1 or p[mbef[i-1]] < p[i-1]:
    mbef[i] = i-1
  else:
    mbef[i] = mbef[i-1]
    

#print(mbef)
smbef = [-1]*n

for i in range(2, n):
  if smbef[i-1] == -1:
    if i-1 != mbef[i]:
      smbef[i] = i-1
    else:
      smbef[i] = mbef[i-1]
  elif smbef[i-1] != -1:
    if i-1 != mbef[i]:
      if p[i-1] > p[smbef[i-1]]:
        smbef[i] = i-1
      else:
        smbef[i] = smbef[i-1]
    else:
      smbef[i] = mbef[i-1]

#print(smbef)

anw = {}
for i in range(n):
  anw[i+1] = 0
    
for i in range(1, n):
  if p[i] < p[mbef[i]] and (smbef[i] == -1 or p[i] > p[smbef[i]]):
    anw[p[mbef[i]]] += 1
    
for i in range(n):
  if mbef[i] == -1 or p[i] > p[mbef[i]]:
    anw[p[i]] -= 1
    
anw_v = 1
anw_c = -2

for val, cnt in anw.items():
  #print(val, cnt)
  if cnt > anw_c or (cnt == anw_c and val < anw_v):
    anw_c = cnt
    anw_v = val
print(anw_v)