#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int N,i,a[1000005],x[1000005],k;
int main()
{
    fin>>N;
    for(i=0;i<N;i++)
    {
        fin>>x[i];
        a[i]=x[i];
    }
    nth_element(a,a+(N/2+1),a+N);
    for(i=0;i<N;i++)
    {
        if(x[i]==a[N/2+1]){k++;}
    }
    if(k>=N/2+1)
    {
        fout<<a[N/2+1]<<" "<<k<<"\n";
    }
    else
    {
        fout<<"-1";
    }
    return 0;
}