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();
        }
        
        int[] typeCounts = new int[5];
        for (int i = 0; i < 5; i++) {
            typeCounts[i] = 0;
        }
        
        for (int i = 0; i < n; i++) {
            typeCounts[types[i] - 1] += 1;
        }
        
        int largestType = 1;
        for (int i = 2; i <= 5; i++) {
            if (typeCounts[i-1] > typeCounts[largestType-1]) {
                largestType = i;
            }
        }
        
        System.out.println(largestType);
    }
}