#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,nr,a[1000000],i,j,max1,e;
int main()
{
	f>>n;
	for(i=1;i<=n;i++)
		f>>a[i];
	sort(a+1,a+n+1);
	i=1;
	while(i<n)
	{
		nr=0;
		if(a[i]==a[i+1]	)
		{nr=1;
			while(a[i]==a[i+1])
			{
				nr++;
				i++;
			}
		}
		else
			i++;
		if(nr>max1) {max1=nr;e=a[i];}
	}
	if(max1>n/2)
		g<<e<<' '<<max1;
	else
		g<<-1;
	return 0;
}