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