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.
import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.PrintWriter;
import java.util.Scanner;

public class _900C {

    private static void solve(Scanner scan, PrintWriter pw) {
        int n = scan.nextInt();
        int[] p = new int[n];
        int[] numInc = new int[n];
        boolean[] isRecord = new boolean[n];

        int max = 0;
        int secondMax = -1;

        for(int i = 0; i < n; i++) {
            p[i] = scan.nextInt();

            if(p[i] > max) {
                isRecord[i] = true;
                secondMax = max;
                max = p[i];
            }
            else if (p[i] > secondMax) {
                numInc[max-1]++;
                secondMax = p[i];
            }
        }

        int maxInc = -2;
        int toRemove = 0;

        for(int i = 0; i < n; i++) {
            int inc = numInc[p[i]-1] - (isRecord[i] ? 1 : 0);
            if(inc > maxInc) {
                maxInc = inc;
                toRemove = p[i];
            }
            else if(inc == maxInc && p[i] < toRemove) {
                toRemove = p[i];
            }
        }

        System.out.println(toRemove);
    }

    public static void main(String[] args) {
        Scanner scan = new Scanner(new BufferedInputStream(System.in, 1024 * 64));
        PrintWriter pw = new PrintWriter(new BufferedOutputStream(System.out, 1024 * 64));
        solve(scan, pw);
        pw.flush();
    }

}