import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution1 {

    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 count[]=new int[5];
        for(int i=0;i<5;i++)
            {
            count[i]=0;
        }
        for(int i=0;i<n;i++)
            {
            if(n>=5&&n<=(Math.pow(10,5))*2&&types[i]>=1&&types[i]<=5)
            count[types[i]-1]++;
        }
        int max=-99; 
        int k=0;
        for(int i=0;i<5;i++)
        {
			if(max<count[i])
			{
				max=count[i];
				k=i;
			}
		}
		System.out.print(k+1);
		
        
    }
}