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];
        int B_Ty=0,B_co=0,co=1;
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
            
        }
        for(int i=0;i<n;i++)
            {
            if(types[i]!=-1)
            for(int j=i+1;j<n;j++)
                {
                if(types[i]==types[j])
                    {
                    co++;
                    types[j]=-1;
                }
            }
            if(co>B_co)
                {
                B_co=co;
                B_Ty=types[i];
            }
            else if(co==B_co)
                {
                if(B_Ty>types[i])
                    {
                    B_Ty=types[i];
                }
            }
            co=1;
        }
        System.out.println(B_Ty);
    }
}