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

public class Solution {
    static void count(int[] types)
        {
        int max=0;
        int id=-1;
        int count=0;
       /* for(int i=0;i<types.length-1;i++)
            {
            int count=0;
           
            for(int j=i;j<types.length;j++)
                {
                if(types[i]==types[j])
                   {
                    count++;
                   }
                
                
            }
            if(count>max)
                 {   max=count;
                id=i;
                 }
            
            }*/
        int element=0;
        Arrays.sort(types);
        
        for(int i=0;i<types.length-1;i++)
            {
            count=0;
            int j=i;
            
            while( j<types.length-1)
            { if(types[j]==types[j+1] )
               { count++;
                j++;
               }
             else
                 break;
            }
            if(count>max)
                {
                max=count;
                element=types[j];
            }
                i=j;
                
            
            
        }
        
                
        
        System.out.println(element);
    }

    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();
        }
        count(types);
    }
}