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[] numberCounter = new int[] {0,0,0,0,0};
        
        int counter = 0;
        while(counter < types.length) {
            int number = types[counter];
            
            if(number == 1) {
                numberCounter[0]++;
            } else if(number == 2) {
                numberCounter[1]++;
            } else if(number == 3) {
               numberCounter[2]++;
            } else if(number == 4) {
                numberCounter[3]++;
            } else if(number == 5) {
                numberCounter[4]++;
            }
            
            counter++;
        }
        
       int solution = 0;
        
        for(int i = 1; i<5; i++) {
            if(numberCounter[i] > numberCounter[solution]) {
                solution = i;
            }
        }
        
        System.out.print(solution+1);
        
    }
    
    
}