/*
    Varianta de curiozitate
    .. nu cred ca iasa din memorie ..
*/

#include    <iostream>
#include    <fstream>

using namespace std;

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

const int NLIM = 1000005;

int N, X[NLIM];
int candidat, appears, var;

void Read()
{
    int nr;
    fin >> N;
    for(int i = 1; i <= N; i++)
    {
        fin >> nr;
        X[nr] += 1;
    }

    for(int i = 1; i <= NLIM; i++)
    {
        if(X[i] > appears)
        {
            appears = X[i];
            candidat = i;
        }
    }

    if(appears < N / 2 + 1) // majoritatea
        fout << "-1";
    else
        fout << candidat << " " << appears;
}

int main()
{
    Read();
    return 0;
}