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[] ctr = new int[6];
        int l =0;
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
        }
        for(int k = 1;k<6;k++){
            ctr[k] = 0;
        for(int i=0;i<n;i++)
            {
            if(k == types[i])
                ctr[k]++;
        }}
        int k=0;
        for(int i=1;i<6;i++)
            {
            if(ctr[i] > l)
                {
                l = ctr[i];
                k=i;
            }
            if(ctr[k] == l)
                {
                if(k>i)
                    {
                    k=i;
                }
            }
        }
        System.out.print(k);
    }
}