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];
           HashMap<Integer,Integer> hashMap=new HashMap<Integer,Integer> ();
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
            hashMap.put(types[types_i],0);
        }
        int maxCount=0;
        int maxType=1000000;
        
        for(int i=0;i< types.length;i++)
            {
         int count= hashMap.get(types[i]);
            count=count+1;
            hashMap.put(types[i],count);
            if(maxCount<count)
                {
             
                maxType=types[i];
                
                maxCount=count;
            }
            else if(maxCount==count)
                {
                if(maxType>types[i])
                    maxType=types[i];
            }
            
        }
System.out.println(maxType);
    }
}