#include <fstream>
#include <algorithm>
using namespace std;
#define dim 1000005
int v[dim];
int main()
{
	ifstream fin("elmaj.in");
	ofstream fout("elmaj.out");
	int n, i;
	fin>>n;
	
	for(i=1;i<=n;++i)
		fin>>v[i];
	
	sort(v+1,v+n+1);
	
	int contor=1, valmaxim=0, re;
	for(i=1;i<=n;++i)
		if(v[i]==v[i+1])
		{
			++contor;
		}
		else
		{
			if(contor>valmaxim)
			{
				valmaxim=contor;
				re=v[i];
			}
			contor=1;
		}
		
		fout<<re <<" "<<valmaxim;
		
	return 0;
}