#include <fstream>
#include <algorithm>
using namespace std;
int a[1000001];
int i, n, k=1, Ok;
int main ()
{
	ifstream f("elmaj.in");
	ofstream g("elmaj.out");
	f >> n;
	for(i=1;i<=n;++i) f >> a[i];
	sort(a+1,a+n+1);
	for(i=1;i<n;++i)
		if(a[i]==a[i+1]) k++;
		else
            if(k>=n/2) {g << a[i] << " " << k; Ok=1; break;}
            else k=1;
	if(Ok==0) g << -1;
	return 0;
}