#include <fstream>
#include <algorithm>

using namespace std;
int n,v[1000005],aux,i,j;

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);
    aux = v[ n/2 + 1];
    for(  i = 1; i <= n / 2; i++ )
        if( aux == v[ i ] )
            break;
    if( v[ i + n/2 ] != aux)
        fout<<-1;
    else
    {
        fout<<aux<<" ";
       for(  j = n/2 + 1; j <= n; j++ )
       {
            if( aux != v[ j ] )
                break;
       }
        fout<< j - i;
    }


    return 0;
}