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.util.Arrays;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class C{

	public static void main(String[] args) throws IOException {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		TreeSet<Integer>set=new TreeSet();
		int[]a=new int [n];
		int min=1000000;
		for(int i=0;i<n;i++)
		{	
			a[i]=sc.nextInt();
			min=Math.min(a[i], min);
		}	
		int []max=new int [n];
		boolean ok=false;
		for(int i=1;i<n;i++)
		{
			if(a[i]<a[i-1])
				ok=true;
		}
		if(!ok)
		{
			System.out.println(a[0]);
			return;
		}
		int []more=new int [100001];
		Arrays.fill(more, -100000);
		max[0]=a[0];
		for(int i=1;i<n;i++)
			max[i]=Math.max(max[i-1],a[i]);
		for(int i=0;i<n;i++)
			more[a[i]]=0;
		
		 for(int i=0;i<n;i++)
		{
			
			
			Integer x=set.ceiling(a[i]);
				
			 if(x!=null && x==max[i])
			{	
				
				more[x]++;
			}
			 if(x==null)
				 more[a[i]]--;
			 			
			 set.add(a[i]);
		}
		
		
		
		int ans=1000000;
		int maxRec=-100000000;
		for(int i=0;i<n;i++)
		{
			
			
				if(more[a[i]]==maxRec)
				{
					ans=Math.min(ans, a[i]);
				}
				else if(more[a[i]]>maxRec)
				{
					maxRec=more[a[i]];
					ans=a[i];
				}
			
		}
		
		System.out.println(ans);
		
	}
	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(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();}


	}

}
