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();
        }
       Map<Integer,Integer> map = new HashMap<>();
        for(int i : types)
            {
            if(map.containsKey(i))
                {
                map.put(i,map.get(i)+1);
            }else
                {
                map.put(i,1);
            }
        }
        Iterator<Integer> itr = map.keySet().iterator();
        int max=0, index=0;
        while(itr.hasNext())
            {
            int ix = itr.next();
            if(max<map.get(ix))
                {
                max=map.get(ix);
                index=ix;
            }
        }
        System.out.print(index);
    }
}