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