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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class C
{
	static int[] fen;
	static int mx = 100005;
	public static void main(String[] args) throws IOException
	{
		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);
		int[] ans = new int[100005];
		int n = sc.nextInt();
		fen = new int[mx];
		for (int i = 0; i < n; i++)
		{
			int x = sc.nextInt();
			int gre = get(mx-1) - get(x);
			if(gre == 1)
			{
				int v = bs(x, mx-1, x);
				ans[v]++;
			}else
				if(gre == 0)
				{
					ans[x]--;
				}
			upd(x, 1);
		}
		
		int mx = -654;
		int val = -2;
		for (int i = 1; i <= n; i++)
		{
			if(ans[i] > mx)
			{
				val = i;
				mx = ans[i];
			}
		}
		
		System.out.println(val);
		
		pw.flush();
		pw.close();
	}
	
	private static int bs(int st, int en, int x)
	{
		if(st == en)
			return st;
		int mid = st + (en-st)/2;
		if(get(mid) - get(x) == 1)
			return bs(st, mid, x);
		else
			return bs(mid+1, en, x);
	}

	static int get(int ind)
	{
		int ans = 0;
		while(ind > 0)
		{
			ans += fen[ind];
			ind -= (ind&-ind);
		}
		return ans;
	}
	
	static void upd(int ind, int val)
	{
		while(ind < mx)
		{
			fen[ind] += val;
			ind += (ind&-ind);
		}
	}
		
	static class Scanner
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s)
		{
			br = new BufferedReader(new InputStreamReader(s));
		}

		public Scanner(String s) throws FileNotFoundException
		{
			br = new BufferedReader(new FileReader(new File((s))));
		}

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

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

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

		public String nextLine() throws IOException
		{
			return br.readLine();
		}

		public double nextDouble() throws IOException
		{
			String x = next();
			StringBuilder sb = new StringBuilder("0");
			double res = 0, f = 1;
			boolean dec = false, neg = false;
			int start = 0;
			if (x.charAt(0) == '-')
			{
				neg = true;
				start++;
			}
			for (int i = start; i < x.length(); i++)
				if (x.charAt(i) == '.')
				{
					res = Long.parseLong(sb.toString());
					sb = new StringBuilder("0");
					dec = true;
				} else
				{
					sb.append(x.charAt(i));
					if (dec)
						f *= 10;
				}
			res += Long.parseLong(sb.toString()) / f;
			return res * (neg ? -1 : 1);
		}

		public boolean ready() throws IOException
		{
			return br.ready();
		}
	}
}
