#include<cstdio>
#include<algorithm>
using namespace std;
int a[1000002],maxim,maj;
int main()
{
	int i,n,contor;
	freopen("elmaj.in","r",stdin);
	freopen("elmaj.out","w",stdout);
	scanf("%d ",&n);
	for(i=1;i<=n;i++)
		scanf("%d ",&a[i]);
	sort(a+1,a+n+1);
	contor=1;
	int x=0;
	for(i=2;i<=n;i++)
	{
		if(a[i]==a[i-1])
			contor++;
		else
			contor=1;
		if(contor>maxim)
		{ 
			maxim=contor;
			x=a[i];
		}
		
		
	}
	printf("%d %d\n",x,maxim);
	
	return 0;
}