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();
        }
         int[] counterArr = new int[5];
        int largest = 0;
        int result =1;
        for(int j=1; j<=5; j++){
            int counter = 0;
            for(int i=0; i < n; i++){
                if(types[i]==j){
                    counter++;
                }
            }
            counterArr[j-1]=counter;
        }
        
        for(int i=0; i<5; i++){
            if(counterArr[i]>largest){
                largest = counterArr[i];
                result = i+1;
            }
        }
        
        
        System.out.println(result);
    }
}