#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,a[1000001],lung,val,lungmax;
bool ok;
int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    sort(a+1,a+n+1);
    int lung=1;
    for(int i=1;i<=n-1;i++){
        if(a[i]==a[i+1]){
            lung++;
        }
        else{
            lung=1;
        }
        if(lung>=n/2+1)
        {
            lungmax=lung;
            val=a[i];
            ok=1;
        }
    }
    if(ok==1)
    fout<<val<<' '<<lungmax;
    else
        fout<<-1;
    return 0;
}