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
        HashMap<Integer,Integer> types_hash= new HashMap<Integer,Integer>();
        types_hash.put(1,0);
        types_hash.put(2,0);
        types_hash.put(3,0);
        types_hash.put(4,0);
        types_hash.put(5,0);
        
        //ArrayList<Integer> t= new ArrayList<Integer>(Arrays.asList(types));
        for(int i=0;i<n;i++)
            {
                switch(types[i])
                    {
                     case 1: types_hash.put(1,types_hash.get(1)+1);
                               break;
                    case 2: types_hash.put(2,types_hash.get(2)+1);
                               break;
                    case 3: types_hash.put(3,types_hash.get(3)+1);
                               break;
                    case 4: types_hash.put(4,types_hash.get(4)+1);
                               break;
                    case 5: types_hash.put(5,types_hash.get(5)+1);
                               break;
                }
        }
            int max=-1;
            int final_id=0;
            for (Map.Entry<Integer, Integer> entry : types_hash.entrySet())  
                {
                if(max<entry.getValue())
                    {
                    max= entry.getValue() ; 
                    
                    final_id=entry.getKey();
                }
                if(max==entry.getValue())
                    {
                    if(final_id>entry.getKey())
                        final_id=entry.getKey();
                }
                   
                
            }
                 System.out.println(final_id);
        
    }
}