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

using namespace std;

long long v[1000000];

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