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 [] counts = new int[5];
        for(int freq = 0; freq < n; freq ++){
            counts[types[freq] - 1] ++;
        }
        int max = counts[0];
        int maxIndex = 0;
        for(int i = 1; i < counts.length; i ++){
            if(counts[i] != 0){
                if(max == counts[i]){
                    max = max;
                    maxIndex = maxIndex;
                }else if(max <counts[i]){
                    max = counts[i];
                    maxIndex = i;
                }
            }   
        }
        System.out.print(maxIndex + 1);
    }
}