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 scn=new Scanner(System.in);
		int n=scn.nextInt();
		int bird[]=new int[n];
		for(int i=0;i<n;i++)
		{
			bird[i]=scn.nextInt();
		}
		fcount(bird,n);
	}

	public static void fcount(int[] bird, int n) 
	{
		
	int count=0;
	int m=0;
	int f[]=new int[5];
	for(int j=0;j<n;j++)
	{
		for(int k=1;k<=5;k++)
		{
			if(bird[j]==k)
			{
				count=f[k-1]+1;
				f[k-1]=count;
				count=0;
			}
		}
	}
	for(int j=0;j<5;j++)
	{
		if(count < f[j])
		{
			count=f[j];
			m=j+1;
		}
	}
	System.out.println(m);
	}
}