#include<fstream>
#include<algorithm>
using namespace std;

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

const int MAXN = 1000010;
int v[MAXN], maax, n, aux, p;

bool cmp(int a, int b){
    return a<b;
}

int main(){
    int i;
    fin >> n;
    maax = n/2 + 1;
    for(i=0; i<n; ++i)
        fin >> v[i];
    sort(&v[0], &v[n], cmp);

    for(i=0; i<n; ++i){
        aux = 1;
        while(v[i] == v[i+1]){
            aux++;
            i++;
        }
        if(aux >= maax){
            maax = aux;
            p = v[i];
            break;
        }
    }

    if(p == 0)
        fout << -1;
    else
        fout << p << " " << maax;

    fin.close();
    fout.close();

    return 0;
}