#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>

using namespace std;

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

int i,n,a[1000001],s=1,mx,nr;

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