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) {
        int[] ca = new int[5];
        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();
            ca[types[types_i]-1] = ca[types[types_i]-1] + 1;
        }
        // your code goes here
        int max=-1;
    int index=-1;
    for(int i=0;i<5;i++){
        if(max < ca[i]){
            max = ca[i];
            index = i;
        }
    }
    System.out.println(index+1);

    }
}