#include <fstream>
#include <cmath>
#include <algorithm>
using namespace std;
int n,a,v[1000001],i,s;
int main ()
{
    ifstream is("elmaj.in");
    ofstream os("elmaj.out");
    is>>n;
    for (i=1;i<=n;++i)
    {
        is>>v[i];
    }
    sort (v+1,v+n+1);
    for (i=1;i<=n;++i)
    {
        if (v[i]!=a)
        {
            a=v[i];s=1;continue;
        }
        if (v[i]==a)
        {
            ++s;
            if (s>(n/2))
                {os<<a<<" "<<s;return 0;}
        }
    }
    os<<"-1";return 0;
}