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_i,i,j;
        int[] types = new int[n];
        for( types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
        }
    
              if (types == null || types.length == 0)
        System.out.println("");

    Arrays.sort(types);

    int previous = types[0];
    int popular = types[0];
    int count = 1;
    int maxCount = 1;

    for (i = 1; i < n; i++) {
        if (types[i] == previous)
            count++;
        else {
            if (count > maxCount) {
                popular = types[i-1];
                maxCount = count;
            }
            previous = types[i];
            count = 1;
        }
    }

    System.out.println( count > maxCount ? types[n-1] : popular);
  
}
        // your code goes here
    }