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