#include <fstream>
#include <cstdio>
#include <algorithm>
using namespace std;

const char input[]="elmaj.in";
const char output[]="elmaj.out";

//ifstream f(input);
ofstream g(output);

long long n, i, a[1000005], nr, maxim, poz;

bool fcomp(int a, int b)
{
	return a<b;
}
void read()
{
	scanf("%lld", &n); //f>>n;
	for(i=1; i<=n; ++i) scanf("%lld", a+i); //f>>a[i];
	sort(a+1, a+n+1, fcomp);
}

void solve()
{
	nr=1;
	for(i=2; i<=n+1; ++i)
	{
		if(a[i]==a[i-1]) ++nr;
		else { if(nr>maxim) { maxim=nr;
							  poz=a[i-1];
							}		
			   nr=1;
		     }
	}
}

void printf()
{
	g<<poz<<" "<<maxim<<"\n";
}

int main()
{
	freopen(input, "r", stdin);
	read();
	solve();
	printf();
	
	fclose(stdin);
	g.close();
	return 0;
}