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();
        }
        
        Map<Integer, Integer> myMap = new HashMap<Integer, Integer>();
        for (int i =0; i < n; i++)
        {  
            if (!myMap.containsKey(types[i]))
            {
                myMap.put(types[i], 0);
            }
            myMap.put(types[i], myMap.get(types[i]) + 1);
            
        }
        
        int maxValue = -1;
        int birdsNumber = -1;
        for (int i = 1; i <= 5; i++)
        {
           if (myMap.containsKey(i))
           {
                int count = myMap.get(i);
               if (count > maxValue)
                   {
                   maxValue = count;
                   birdsNumber = i;
               }
           }
        }
        
        System.out.println(birdsNumber);
    }
}