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 arlen=types.length;
       // System.out.println(arlen);
        
        int count[]=new int[5];
        for(int i=0;i<types.length;i++)
        {
            switch(types[i])
            {
                case 1 :count[0]++;
                        break;
                 case 2:count[1]++;
                        break;
                 case 3 :count[2]++;
                        break;
                 case 4 :count[3]++;
                        break;
                 case 5 :count[4]++;
                        break;
                
            }
        }
        
        int gst=count[0];
        int j=0;
        for(int i=0;i<5;i++)
            {
            if(count[i]>gst)
            {    gst=count[i];
                j=i+1;
            }
        }
        System.out.println(j);
    }
}