#include<cstdio>
#include<algorithm>
using std::sort;

int v[1000005];
int main()
{
	freopen ("elmaj.in","r",stdin);
	freopen ("elmaj.out","w",stdout);
	int n;
	scanf ("%d",&n);
	for(int i=0;i<n;i++)
		scanf ("%d",v+i);
	sort (v,v+n);
	int e=v[n/2];
	int cnt=0;
	for(int i=0;i<n;i++)
		if(v[i]==e)
			cnt++;
	if(cnt<=n/2)
		printf ("-1");
	else
		printf ("%d %d",e,cnt);
	return 0;
}