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 static java.util.Arrays.*;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import java.util.*;
import java.math.*;
import java.io.*;

public class Main implements Runnable {
    
	boolean TEST = System.getProperty("ONLINE_JUDGE") == null;
    
    void solve() throws IOException {
    	int n = nextInt();
    	int[] a = new int[n + 1];
    	int[] maxValue = new int[n + 1];
    	int[] secondMaxValue = new int[n + 1];
    	TreeSet<Integer> set = new TreeSet<>();
    	set.add(0);
    	int[] index = new int[n + 1];
    	for (int i = 1; i <= n; i++) {
    		a[i] = nextInt();
    		index[a[i]] = i;
    		set.add(-a[i]);
    		maxValue[i] = -set.first();
    		int b = -set.pollFirst();
    		secondMaxValue[i] = -set.first();
    		set.add(-b);
    	}
    	//debug(maxValue);
    	//debug(secondMaxValue);
    	//debug(index);
    	int[] count = new int[n + 1];
    	for (int i = 1; i <= n; i++) {
    		if (a[i] > maxValue[i - 1]) {
    			count[i]--;
    		}
    		if (a[i] < maxValue[i - 1] && a[i] > secondMaxValue[i - 1]) {
    			int j = index[maxValue[i - 1]];
    			count[j]++;
    		}
    	}
    	//debug(count);
    	int res = -1, val = Integer.MAX_VALUE;
    	for (int i = 1; i <= n; i++) {
    		if (count[i] > res || (count[i] == res && val > a[i])) {
    			val = a[i];
    			res = count[i];
    		}
    	}
    	//debug(res, val);
    	out.println(val);
    }
    
    String next() throws IOException {
        while(st == null || !st.hasMoreTokens()) st = new StringTokenizer(input.readLine());
        return st.nextToken();
    }
    
    int nextInt() throws IOException {
        return Integer.parseInt(next());
    }
    
    long nextLong() throws IOException {
        return Long.parseLong(next());
    }
    
    double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
    
    void debug(Object... o) {
        System.out.println(deepToString(o));
    }
    
    void gcj(Object o) {
        String s = String.valueOf(o);
        out.println("Case #" + test + ": " + s);
        System.out.println("Case #" + test + ": " + s);
    }
    
    BufferedReader input;
    PrintWriter out;
    StringTokenizer st;
    int test;
    
    void init() throws IOException {
        if (TEST) input = new BufferedReader(new FileReader("input.in")); 
        else input = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(new BufferedOutputStream(System.out));
    }
    
    public static void main(String[] args) throws IOException {
        new Thread(null, new Main(), "", 1 << 20).start();
    }
    
    public void run() {
        try {
            init();
            if (TEST) {
                int runs = nextInt();
                for(int i = 0; i < runs; i++) solve();
            } else solve();
            out.close();        
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(1);
        }
    }
}