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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;

public class c {

	public static void main(String args[]) throws IOException {
		FastScanner in = new FastScanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		//BEGIN HERE

		int n = in.nextInt();
		
		int numbers[] = new int[n];
		HashMap<Integer, Integer> mp = new HashMap<>();
		for(int i = 0; i < n; i++) {
			numbers[i] = in.nextInt();
			mp.put(numbers[i], i);
		}
		
		int mn = 0;
		ArrayList<Integer> mins = new ArrayList<Integer>();
		for(int i = 0; i < n; i++) {
			if(numbers[i] > mn) {
				mn = numbers[i];
				mins.add(numbers[i]);
			}
		}
		
		int best = -1, ba = -1;
		for(int i = 0 ; i < mins.size(); i++) {
			int v = mins.get(i);
			int start = mp.get(v), end;
			if(i != mins.size()-1) {
				end = mp.get(mins.get(i+1)) - 1;
			} else end = n - 1;
			int prev = 0;
			if(i != 0) prev = mins.get(i-1);
			int ans = 0;
			for(int j = start + 1; j <= end; j++) {
				if(numbers[j] > prev) {
					ans ++;
					prev = numbers[j];
				}
			}
			if(ans > best) {
				ba = v;
				best = ans;
			} else if(ans == best) {
				ba = Math.min(v,  ba);
			}
		}
		if(best <= 1) {
			int idx = 0;
			for(int i = 1; i <= n; i++) {
				if(mins.get(idx++) != i) {
					out.println(i);
					out.close();
					return;
				}
			}
		}
		out.println(ba);
		out.close();
	}

	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(InputStream i) {
			br = new BufferedReader(new InputStreamReader(i));
			st = null;
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public String nextLine() throws IOException {
			if (st == null) {
				st = new StringTokenizer(br.readLine());
			}
			String line = st.nextToken("\n");
			st = null;
			return line;
		}

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

		public long nextLong() throws IOException {
			return Long.parseLong(next());
		}

		public double nextDouble() throws IOException {
			return Double.parseDouble(next());
		}
	}
}

/*
10
1 2 6 3 4 9 5 7 8 10

10
1 2 6 3 4 10 5 7 8 9

*/
