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

using namespace std;

ifstream f("elmaj.in");
ofstream g("elmaj.out");

int i,j,n,a[1000001],nr,nr1,mx;

int main()
{
    f>>n;
    for (i=1;i<=n;i++){
        f>>a[i];
    }
    sort(a+1,a+n+1);
    nr=1;
    for (i=1;i<n;i++){
        if (a[i]==a[i+1])
            nr++;
        else
            nr=1;
        if (nr>mx){
            mx=nr;
            nr1=a[i];
        }
    }
    if(mx<n/2+1)
		cout<<-1;
	else
		cout<<nr1<<" "<<mx;
    return 0;
}