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 sc = new Scanner(System.in);
        int n = sc.nextInt();
        Integer[] arr = new Integer[n];
        boolean[] b = new boolean[n];
        for(int i = 0; i < n; i++){
            arr[i] = sc.nextInt();
            b[i] = false;
        }
        
        Arrays.sort(arr, Collections.reverseOrder());
        
        int max = 0;
        int type = -1;
        for(int i = 0; i < n; i++) {
            int sum = 1;
            if (!b[i]) {
                for(int j = i+1; j < n; j++) {
                    if (arr[i] == arr[j]) {
                        sum++;
                        b[j] = true;
                    }
                }
            }
            
            if (sum >= max) {
                max = sum;
                type = arr[i];
            }
        }
        System.out.println(type);
    }
}