#include<fstream>
#include<algorithm>

using namespace std;

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

int n,v[1000003],sol1,sol2;

int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
    }
    sort(v+1,v+1+n);
    sol1=v[n/2];
    sol2=1;

    int x=v[n/2-1];
    int i1=1;
    while(sol1==x && i1<n/2)
    {
        sol2++;
        i1++;
        x=v[n/2-i1];
    }
    i1=1;
    x=v[n/2+1];
    while(sol1==x && i1<n/2)
    {
        sol2++;
        i1++;
        x=v[n/2+i1];
    }
    if(sol2>=n/2+1)
    fout<<sol1<<" "<<sol2;
    else
        fout<<"-1";

}