#include <cstdio>
#include <algorithm>
using namespace std;
int n,v[1000001],i,Max=0,nr,j,Max2=0,m,viz[1000001],k;
int main()
{
	freopen("elmaj.in","r",stdin);
    freopen("elmaj.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	scanf("%d",&v[i]);
	for(i=1;i<=n;i++)
	viz[v[i]]++;
	sort(v+1,v+n+1);
	for(i=1;i<=n;i++)
	if(v[i]!=v[i+1])
	k++;
	for(i=1;i<=n;i++)
	if(viz[i]>Max)
	{Max=viz[i];m=i;}
	for(i=1;i<=n;i++)
	if(viz[i]==viz[i+1] && viz[i]!=0)
	nr++;
	if(k==nr)
	printf("%d",-1);
	else
	printf("%d %d",m,Max);

    return 0;
}