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];
        int[] count = new int[5];
        int maxCount = 0;
        int pos = 0;
        
        for(int types_i=0; types_i < n; types_i++){
            //types[types_i] = in.nextInt();
            switch(in.nextInt()){
                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;
                
            }
        }
        for(int i = 4; i>=0; i--){

            if(count[i]>= maxCount){
                maxCount = count[i];
                pos = i;
            }
        }
       
        System.out.println(pos+1);
    }
}