Codeforces 900C 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.

题目链接： http://codeforces.com/contest/900/problem/C

题意：给一个长度为n的序列，从个序列中去掉一个数，使得有尽量多的子序列满足下列条件：对于j < i, 任何a[j] < a[i]。如果有多种情况，输出去掉的最小的一个数。

思路：求出逆序数最大的一个数去掉即可（即这个数后面有最多小于他的数）

#include 
using namespace std;

int n,x,p,q,a[100100];

int main(){
    scanf("%d",&n);
    for(int i = 0; i < n; i ++){
        scanf("%d",&x);
        if(x > p) a[x] = 1, q = p, p = x;
        else if(x > q) a[p] --, q = x;
    }
    int ans = 1;
    for(int i = 1; i <= n; i ++) if(a[i] < a[ans]) ans = i;
    printf("%d\n",ans);
    return 0;
}