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[] count = new int [5];
        int max = 0;
        int maxBird = 0;
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
            count[types[types_i]-1]++;
            if (count[types[types_i]-1] > max) {
                max = count[types[types_i]-1];
                maxBird = types[types_i];
            } else if (count[types[types_i]-1] == max) {
                if (types[types_i] < maxBird ){
                    maxBird = types[types_i];
                }
            }
            
        }
        System.out.println(maxBird);
        
    }
}