import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.util.HashMap;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
       	HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();
	        int n = in.nextInt();
	        int[] types = new int[n];
	        for(int types_i=0; types_i < n; types_i++){
	            types[types_i] = in.nextInt();
	            if(map.containsKey(types[types_i])==false){
	            map.put(types[types_i],1);
	            }else{
	            	map.put(types[types_i],map.get(types[types_i])+1);  
            }
	        }
	        int max=0;
	        for(int i=1;i<6;i++){
                if(map.get(i)!=null){
	        	if(map.get(i)>max){
	        		max = map.get(i);
	        	}
	        }
            }
	      for (java.util.Map.Entry<Integer, Integer> entry : map.entrySet()) {
	            if (entry.getValue().equals(max)) {
	                max = entry.getKey();
	            }
	        }
	        System.out.println(max);
        // your code goes here
    }
}