C. Remove Extra Onetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou 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. InputThe 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.OutputPrint 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.ExamplesInput11Output1Input55 1 2 3 4Output5NoteIn the first example the only element can be removed.
Input11
Output1
['brute force', 'data structures', 'math', '*1700']