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();
        }
        
        /*Arrays.sort(types);
        int count=0;
        int highestCount=0;
        int highestType = types[0];
        int currentNumber = types[0];
        for(int i=0; i<n;i++){
            if(currentNumber==types[i]){
                count++;
            }else{
                if(count>highestCount)
                {
                    highestCount=count;
                    highestType=currentNumber;
                }    
                count=1;
                currentNumber=types[i];
            }
        }
        System.out.println(highestType);*/
        int[] countArray={0,0,0,0,0};
        for(int i=0;i<n;i++){
            countArray[types[i]-1]++;
        }
        int max=countArray[0];
        int maxType = 1;
        for(int i=1;i<5;i++){
            if(countArray[i]>max){
                max=countArray[i];
                maxType=i+1;
            }
        }
        System.out.println(maxType);
        // your code goes here
    }
}