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