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