#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int N;
unsigned v[1000000];
unsigned Max,k;

ifstream f("elmaj.in");
ofstream g("elmaj.out");

int main()
{
	int i;
	unsigned int cif,sol;
	f>>N;
	for(i = 0 ; i < N; i++) {
		f>>v[i];
	}
	sort(&v[0],&v[N]);
	cif = v[0];
	for(i = 0 ; i < N; i++) {
		if(v[i] == cif) {
			k++;
		} else {
			if(k > Max) {
				Max = k;
				sol = cif;
			}
			k = 1;
			cif = v[i];
		}
	}
	g<<sol<<" "<<Max;
}