#include <cstdio>
#include <algorithm>
using namespace std;

FILE*fin=fopen("emaj.in","r");
FILE*fout=fopen("emaj.out","w");
int i,j,k,a,b,v[1000005],rasp,raspe,nr,nre,n;
int main()
{
    fscanf(fin,"%d",&n);
    for (i=0;i<n;i++)
    fscanf(fin,"%d",&v[i]);
    sort(v,v+n);
    for (i=0;i<n;i++)
    {rasp=v[i];
{
    nr=0;
    while (rasp==v[i])
    {
        ++nr;
        ++i;
    }
    if (nr>nre)
    {
        nre=nr;
        raspe=rasp;
    }
}}
if (nre>n/2)
{
    fprintf(fout,"%d %d\n",raspe,nre);
}
else fprintf(fout,"-1\n");

    return 0;
}