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