#include<cstdio>
#include<algorithm>
#include<vector>
#define mod 1111113
using namespace std;
int n,i,j,k,rez,maxim,x;
bool ok;
vector<pair<int,int> >v[mod+5];
int main()
{
	freopen("elmaj.in","r",stdin);
	freopen("elmaj.out","w",stdout);
	scanf("%d",&n);
	for (i=1;i<=n;i++)
	{
		scanf("%d",&k);
		x=k%mod;
		ok=false;
		for (j=0;j<v[x].size();j++)
			if (v[x][j].first==k)
			{
				ok=true;
				v[x][j].second++;
				if (v[x][j].second>=rez) maxim=v[x][j].second,rez=v[x][j].first;
			}
		if (!ok) v[x].push_back(make_pair(k,1));
	}
	if (maxim<n/2+1) printf("-1\n");else 
		printf("%d %d\n",rez,maxim);
	return 0;
}