#include <bits/stdc++.h>

using namespace std;

ifstream fin("elmaj.in");
ofstream fout("elmaj.out");

int n,v[1000005],ind;

int main()
{
    fin>>n;
    for(int i=1;i<=n;++i)
        fin>>v[i];
    sort(v+1,v+n+1);
    for(int i=1;i<=n;++i)
    {
        ind=i;
        while(v[i]==v[i+1] && i<=n)
            ++i;
        if(i-ind+1>n/2)
        {
            fout<<v[ind]<<' '<<i-ind+1;
            return 0;
        }
    }
    fout<<-1;
    return 0;
}