#include <fstream>
#include <algorithm>
using namespace std;
int n, v[1000005], i, nr, nrap, nrapmax;

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

int main(){
    fin>>n;
    for(i=1;i<=n;i++){
        fin>>v[i];
    }
    sort(v+1, v+n+1);
    nrap = 1;
    for(i=1;i<n;i++){
        if(v[i] == v[i+1]){
            nrap++;
            if(nrap > nrapmax){
                nrapmax = nrap;
                nr = v[i];
            }
        }else{
            nrap = 1;
        }
    }
    if(nrapmax >= n/2+1){
        fout<<nr<<" "<<nrapmax;
    }else{
        fout<<-1;
    }
}