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();
        }
        // your code goes here
        int numberOfBirds[] = new int[5];
        for (int i =0 ; i < types.length;i++)
            {
            switch (types[i]) {
                 case 1: numberOfBirds[0] = numberOfBirds[0] + 1;
                         break;
                 case 2: numberOfBirds[1] = numberOfBirds[1] + 1;
                         break;    
                case 3:
                    numberOfBirds[2] = numberOfBirds[2] + 1;
                    break;
                case 4:
                    numberOfBirds[3] = numberOfBirds[3] + 1;
                    break;
                case 5:
                    numberOfBirds[4] = numberOfBirds[4] + 1;
                    break;
                default:
                    break;
            }
               
        }
        int temp = numberOfBirds[0];
        int commonType = 1;
        for(int i =1 ; i <5 ; i++)
            {
            if(numberOfBirds[i] > temp)
                {
                temp = numberOfBirds[i];
                commonType = i+1;
            }
            else if(numberOfBirds[i] == temp)
                {
                if (i+1 < commonType)
                    {
                    commonType = i+1;
                }
            }
        }
        System.out.println(commonType);
    }
}