#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <algorithm>
using namespace std;

const int maxn=10000+10;
int cnt,n;
int a[maxn];
int ans=-1,m;
int main()
{
	freopen("leader.in","r",stdin);
	freopen("leader.out","w",stdout);

	cin>>m>>n; m=n/2;
	for(int i=1; i<=n; i++)
		cin>>a[i];
	sort(a+1,a+1+n);
	if(n==1)
	{
		cout<<a[1]<<endl;
		return 0;
	}
	for(int i=1; i<=n; i++)
	{
		if(a[i]==a[i-1])
		{
			cnt++;
			if(cnt>m) ans=a[i],m=cnt;
		} 
		else
		{
			cnt=1;
		}
	}
	cout<<ans<<endl;

	return 0;
}