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

public class Solution {
static Scanner in=new Scanner(System.in);
    public static void main(String[] args)
	{
		int n = in.nextInt();
        int[] types = new int[n];
        int[] t=new int[5];
        for(int types_i=0; types_i < n; types_i++)
        {
            types[types_i] = in.nextInt();
            switch(types[types_i])
            {
            case 1:
            {
            	t[types[types_i]-1]++;
            	break;
            }
            case 2:
            {
            	t[types[types_i]-1]++;
            	break;
            }
            case 3:
            {
            	t[types[types_i]-1]++;
            	break;
            }
            case 4:
            {
            	t[types[types_i]-1]++;
            	break;
            }
            case 5:
            {
            	t[types[types_i]-1]++;
            	break;
            }
            }
        }
        int max=0,k=5;
        for(int i=0;i<t.length;i++)
        {
        	if(t[i]>max)
        	{
        		max=t[i];
        		k=i;
        	}
        }
        System.out.println(k+1);
	}
}