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[] times = new int[5];
        // your code goes here
        for(int i=0; i<n; i++){
            times[types[i]-1]=times[types[i]-1]+1;
        }
        int largest = times[0];
        int largestNum = 1;
        for(int i=1; i<5;i++){
            if(times[i]>largest){
                largest = times[i];
                largestNum = i+1;
            }
        }
        System.out.println(largestNum);
    }
}