#include <fstream>
#include <algorithm>

using namespace std;

int v[1000001];
int main()
{
    int n,i,nr;
    ifstream fin("elmaj.in");
    ofstream fout("elmaj.out");
    fin>>n;
    for (i=1;i<=n;i++)
        fin>>v[i];
    sort(v+1,v+n+1);
    int a;
    nr=1;
    i=n/2;
    while (v[i-1]==v[i])
    {
        nr++;
        i--;
    }
    i=n/2;
    while (v[i]==v[i+1])
    {
        nr++;
        i++;
    }
    if (nr>=n/2+1)
        fout<<v[n/2]<<" "<<nr;
    else
        fout<<-1;
    return 0;
}