#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a[1000003];
int main()
{
    int i,n,k=1,max=0,f;
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>a[i];
    sort(a+1,a+1+n);
    for(i=1;i<=n-1;i++)
        if(a[i]==a[i+1])
        k++;
    else
    {
        if(k>max)
            {max=k;
            f=a[i];}
        k=1;
    }
    if(max>=n/2+1)
        fout<<f<<" "<<max;
    else
        fout<<-1;
}