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 k=5;
        int[] count = new int[k];
       
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
            count[types[types_i]-1]++;                      
        }
        
       /* for(int i=0;i<n;i++)
            {
          System.out.print(types[i]+" ");
        }*/
            
        
        int max = count[0], result = 0;
        for (int i = 1; i < k; i++)
        {
        if (count[i] > max)
        {
            max = count[i];
            result = i;
        }
         if(count[i]==max)
        {
            if(result>i)
                {
                max = count[i];
                result = i;
            }
            else continue;
        } 
        }
        
        
      
        System.out.println(result+1);
    }
}