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 = {0,0,0,0,0,0}; // So we can use types as indexies. 
        //int temp; 
        for (int i = 0; i < n; i++) {
            counts[in.nextInt()]++; 
        }
        in.close(); 
        
        int max_size = 0; 
        int max_type = 0; 
        for (int i = 1; i <= 5; i++) {
            if (counts[i] > max_size) {
                max_size = counts[i]; 
                max_type = i; 
            }
        }
        
        System.out.println(max_type); 
    }
}