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