#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,i,v[1000005],x,c,mx,maxn;
int main() {
	f>>n;
	for (i=1;i<=n;i++) f>>v[i];
	sort(v+1,v+n+1);
	for (i=1;i<=n;) {
		c=0;
		x=v[i];
		while (x==v[i]) {
			i++;
			c++;
		}
		if (c>mx) {
			mx=c;
			maxn=x;
		}
	}
	if (mx>n/2) g<<maxn<<" "<<mx;
	else g<<"-1";
	return 0;
}