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.*;
import java.util.StringTokenizer;

public class Main {
    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());
        }
    }
    static void solve(int testNumber, InputReader in, PrintWriter out) {
        int n=in.nextInt();
        int max=0;
        int sec=0;
        int p=0;
        int ans=1;
        int[] a=new int[1000005];
        for(int i=0;i<n;i++){
            p=in.nextInt();
            if(p>max){
                sec=max;
                max=p;
                a[max]=a[max]-1;
            }else if(p<sec){
                continue;
            }else{
                    a[max] =a[max] + 1;
                    sec = p;
            }
        }
        for(int i=1;i<=n;i++){
            if(a[i]>a[ans]){
                ans=i;
            }
        }
        out.println(ans);
    }
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        solve(1,in,out);
        out.close();
    }
}

			  	 		  	 	  	   	 		   		 	