CF900C：Remove Extra One（思维）

C. Remove Extra One

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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个数的排列，要求移走一个数，使得record数最多。record数就是这个数比排在它前面的数都大。

思路：假如a[i]移走后后面多了一个record数a[j]，那么必然满足a[i] > a[j]并且1~j-1的数里面>a[j]的数只有a[i]一个，我们可以遍历数组的时候用树状数组维护，或者直接维护最大和次大的两个数。代码中a[i]表示i这个数移走后增加的record数。

# include <iostream>
# include <cstdio>
using namespace std;
const int maxn = 1e5+30;
int a[maxn];
int main()
{
    int n, x, imaxx=-1e9,imax=-1e9, ans=1;
    scanf("%d",&n);
    for(int i=1; i<=n; ++i)
    {
        scanf("%d",&x);
        if(x > imaxx) imax=imaxx, imaxx = x, a[x]=-1;
        else if(x > imax) ++a[imaxx], imax = x;
    }
    for(int i=1; i<=n; ++i)
        if(a[i] > a[ans])
            ans = i;
    printf("%d\n",ans);
    return 0;
}