CF900C.Remove Extra One

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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 $a_{1},a_{2},...,a_{k}$ the element $a_{i}$ is a record if for every integer $j$ ( 1<=j<i ) the following holds: a_{j}<a_{i} .

输入格式

The first line contains the only integer $n$ ( $1<=n<=10^{5}$ ) — the length of the permutation.

The second line contains $n$ integers $p_{1},p_{2},...,p_{n}$ ( $1<=p_{i}<=n$ ) — the permutation. All the integers are distinct.

输出格式

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.

输入输出样例

输入#1
```
1
1
```
输出#1
```
1
```
输入#2
```
5
5 1 2 3 4
```
输出#2
```
5
```

说明/提示

In the first example the only element can be removed.

首页