#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

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

#define lim 1000001
int n,v[lim],st,dr,el;

int main()
{
    fin>>n;

    for(int i=1; i<=n; i++)
        fin>>v[i];

    sort(v+1,v+n+1);

    el=v[n/2];
    st=n/2;

    while(v[st]==el)
        st--;
    st++;

    dr=n/2;
    while(v[dr]==el)
        dr++;
    dr--;

    if(dr-st+1 >= n/2+1)
        fout<<el<<' '<<dr-st+1;
    else
        fout<<-1;

    fin.close();
    fout.close();
    return 0;
}