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