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 count[] = new int[5];
       
        for(int i = 0; i < n; i++){
            
            switch (types[i])
                {
                
                case 1:
                count[0] += 1;
                break;
                case 2:
                count[1] += 1;
                break;
                case 3:
                count[2] += 1;
                break;
                case 4:
                count[3] += 1;
                break;
                case 5:
                count[4] += 1;
                break;
                
            }
        }
        int max = 0;
        int maxCount = 0;
        for(int i = 0; i < 5; i++){
            
            if(count[i] == maxCount){
                max = max > (i+1) ? (i+1): max;
                maxCount = count[i];
            }            
            else if(count[i] > maxCount ){
                max = i+1;
                maxCount = count[i];
        }
        }
        System.out.println(max);
    }
}