#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, i, v[1000001], k, maxi, j, ok1;
int main()
{
	f>>n;
	for(i=1;i<=n;i++)
	{
		f>>v[i];
	}
	sort(v+1,v+n+1);
	i=1;
	while(i<=n)
	{
		j=i;
		while(j<=n&&v[j+1]==v[i])j++;
		if(j-i+1>n/2)
		{
			g<<v[i]<<" "<<j-i+1;
			ok1=1;
			i=n+1;
			j=n+2;
		}
		i=j+1;
	}
	if(!ok1)g<<-1;
	f.close();
	g.close();
	return 0;
}