#include<iostream>
#include<fstream>
#include<algorithm>
#include<string>
#include<vector>
#include<map>

using namespace std;

ifstream f("elmaj.in");
ofstream g("elmaj.out");

int main(){
    int n,i,x;
    map<int , int> a;
    map<int ,int>::iterator it;

    f>>n;
    for(i=1; i<=n; ++i){
        f>>x;
        if(a.find(x)->first>0)
            a.insert(pair<int ,int>(x,0));
        a[x]++;
    }

    int m=n/2 + 1,r=-1;

    for(it=a.begin(); it!=a.end(); ++it){
        if(it->second >= m) {
            r=it->first;
            x=it->second;
            break;
        }
    }

    if(r!=-1)
        g<<r<<" "<<x;
    else
        g<<r;


return 0;
}