#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");

long long n,v[1000001],i,k,ap,j,x,a;
bool ok;
int main()
{
    fin>>n;
    for(i=1; i<=n; i++)
        fin>>v[i];
    k=1;
    sort(v+1,v+n+1);
    for(i=1; i<n&&!ok; i++)
    {
        if(v[i]==v[i+1]) k++;
        else
        {
            if(k>n/2)
            {
                ok=1;
                a=v[i];
                x=k;
            }
            k=1;
        }
    }
    if(k>n/2)
    {
        ok=1;
        a=v[i];
        x=k;
    }
    if(ok) fout<<a<<' '<<x;
    else fout<<"-1";
    return 0;

}