#include<stdio.h>
#include<algorithm>

using namespace std;

long a[1000007];

int main()
{
	
	long n,i,nr,poz,max2=0;
	
	freopen("elmaj.in","r",stdin);
	freopen("elmaj.out","w",stdout);
	
	scanf("%ld",&n);
	
	for (i=1;i<=n;i++)
		scanf("%ld",&a[i]);
	
	sort(a+1,a+n+1);
	
	nr=1;
	
	for (i=1;i<=n-1;i++)
		if (a[i]==a[i-1])
			nr++;
		else
		{
			
			if (max2<nr)
			{
				
				max2=nr;
				
				poz=a[i-1];
				
			}
			
			nr=1;
			
		}
	
	printf("%ld %ld",poz,max2);
	
	return 0;
	
}