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 index=0;
         int smallest=0;
        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<5;i++){
            for(int k=0;k<n;k++){
                if(types[k]==(i+1)){
                    count[i]++;// 5 2 10 15 10
                }
            }
        }
        int minOfMax=0;
        int max=count[0];
        for(int u=0;u<5;u++){
            if(count[u]>max){
                max=count[u];
                minOfMax=u;
            }
        }
        
        for(int a=0;a<5;a++){
            if(a!=minOfMax){
                if(count[a]==count[minOfMax]){
                    if(minOfMax>a){
                        minOfMax=a;
                    }
                }
            }
        }
        
        System.out.print(minOfMax+1);
    }
        
}