#include <cstdio>
#include <fstream>
#include <algorithm>

using namespace std;

int v[1000001],n,k,cont;

void read ()
{
	ifstream in ("elmaj.in");
	in>>n;
	for(int i=1;i<=n;++i)
		in>>v[i];
	}

void solve ()
{
	nth_element(v+1,v+(n>>1),v+n+1);
	k=v[n>>1];
	for(int i=1;i<=n;++i)
		if(v[i]==k)
			++cont;
	}

void out ()
{
	freopen ("elmaj.out","w",stdout);
	if(cont>(n>>1))
		printf("%d %d",k,cont);
	else
		printf("-1");
	}

int main ()
{
	read ();
	solve ();
	out ();
	return 0;}