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 = {0,0,0,0,0};
        for (int i = 0;i<types.length;i++){
            switch(types[i]){
                case 1:
                    count[0]++;
                    break;
                case 2:
                    count[1]++;
                    break;
                case 3:
                    count[2]++;
                    break;
                case 4: 
                    count[3]++;
                    break;
                case 5: 
                    count[4]++;
                    break;
            }
        }
        int max = 0;
        int num = -1;
        for (int i = 0;i<5;i++){
            if (count[i] > max){
                max = count[i];
                num = i+1;
            }
           if (count[i] == max){
               if (i+1< num){
                    num = i+1;
               }
            }
            
        }
        System.out.println(num);
        // your code goes here
    }
}