#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int N,a[1000010],s,n,k,retin,x,ok;
int main()
{
    f >> N;
    for(int i = 1; i <= N; i++){
        f >> a[i];
    }
    sort(a+1,a+1+N);
    for(int i = 1; i <= N/2 + 1; i++){
        if(a[i] == a[i + N/2]){
            g << a[i] <<" ";
            retin = i + N/2;
            x = a[i];
            ok = 1;
            break;
        }
    }
    if(ok == 0){
        g << -1;
        return 0;
    }
    s = N/2 + 1;
 //   g << retin;
    retin += 1;
    for(int i = retin; i <= N; i++){
        if(a[i] == x)
            s++;
        else
            break;
    }
    g << s;
    return 0;
}