import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] types = new int[n];
       
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
        }
      
        int val=1;
    Map<Integer, Integer> m = new LinkedHashMap<>();
    for(int i=0;i<n;i++){
    	if(!m.containsKey(types[i])){
    		
    		m.put(types[i], val);
    		
    	}else{
    		
    		m.put(types[i], m.get(types[i])+1);
    	}
    }
 
  Map.Entry<Integer, Integer> entry = m.entrySet().iterator().next();
  int ID = entry.getKey();
  int c = entry.getValue();
    Set<Integer> k = m.keySet();
    for(int i :k)
    {
    	if(m.get(i)>c){
    		
    		c=m.get(i);
    		ID=i;
    		
    	}else if(m.get(i)==c){
    		ID= (i>ID)? ID:i;
    		
    	}
    }
        
        
     System.out.println(ID);   
        
    }
}