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.
//package info.stochastic;

import java.io.*;
import java.util.StringTokenizer;

public class C {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int[] arr = new int[100002];
            int[] ans = new int[100002];
            int[] record = new int[100002];

            int n = in.nextInt();

            for (int i = 0; i < n; i++) {
                arr[i] = in.nextInt();
            }

            if (n == 1) {
                out.println(1);
                return;
            }

            int max = arr[0];
            int secondMax = -1;
            int minZeroEl = 100005;
            record[arr[0]] = 1;
            for (int i = 1; i < n; i++) {
                if (arr[i] > max) {
                    record[arr[i]] = 1;
                }

                if (arr[i] < max && arr[i] > secondMax) {
                    ans[max]++;
                }

                if (arr[i] < max && arr[i] < secondMax) {
                    minZeroEl = Math.min(minZeroEl, arr[i]);
                }

                if (arr[i] > max) {
                    secondMax = max;
                    max = arr[i];
                } else if (arr[i] > secondMax) {
                    secondMax = arr[i];
                }
            }

            int resValue = 0;
            int resIndex = 0;
            for (int i = 1; i < n + 1; i++) {
                if (ans[i] > resValue) {
                    resValue = ans[i];
                    resIndex = i;
                }
            }

            //out.println("res " + resValue);
            //out.println("res index " + resIndex);
            //out.println("min " + minZeroEl);
            //out.println("rec " + record[resIndex]);
            if (resValue == 0) {
                out.print(minZeroEl == 100005 ? 1 : minZeroEl);
            } else if (resValue == 1 && record[resIndex] == 1) {
                out.print(Math.min(resIndex, (minZeroEl == 100005 ? 1 : minZeroEl)));
            } else {
                out.print(resIndex);
            }
        }
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
    }
}
