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[]{0,0,0,0,0};
        for(int types_i=0; types_i < n; types_i++){
            types[in.nextInt()-1] += 1;
        }
        in.close();

        int max = Integer.MIN_VALUE;
        int bird = 0;
        for(int i=0; i<types.length; i++){
            if(types[i]>max) {
                max = types[i];
                bird = 1 + i;
            }   
        }
        System.out.print(bird);
    }
}