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[] counter = new int[5];
        for(int i=0; i<5; i++) {
            counter[i] = 0;
        }
        for(int i=0; i<n; i++) {
            for(int j=0; j<5; j++) {
            if(types[i] == (j+1)) {
                counter[j] = counter[j]+1;
                }
            }
        }
        int max = counter[0];
        int maxType = 1;
        for(int i=1; i<5; i++) {
            if(counter[i] > max) {                
                max = counter[i];
                maxType = i+1;
            } else if(counter[i] == max) {
                if(i+1 < maxType) {
                    maxType = i+1;
                }
            }
        }
        System.out.println(maxType);
    }
}