#include <fstream>
#include <algorithm>
using namespace std;
long long n,v[100002],i,mx,k,l;
int main()
{
    ifstream f ("elmaj.in");
    ofstream g ("elmaj.out");
    f>>n;
    for (i=1;i<=n;i++) f>>v[i];
    sort (v+1,v+n+1);
    mx=v[1]; l++;
    for (i=1;i<=n;i++)
    {
        if (v[i]==v[i+1])
        {
            l++;
        }
        else
        {
            if (l>k)
            {
                mx=v[i]; k=l;
            }
            l=1;
        }
    }
    if (k>n/2)
    {
        g<<mx<<" "<<k;
    }
    else g<<"-1";
    return 0;
}