#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a[1000005];
int main(){
    int n,i,m=1;
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>a[i];
    sort(a+1,a+n+1);
    for(i=1;i<n&&m<n/2+1;i++){
        if(a[i]==a[i+1]) m++;
        else m=1;
    }
    if(i==n) fout<<-1;
    else{
        while(a[i]==a[i+1]&&i<n)
            i++,m++;
        fout<<a[i]<<" "<<m;
    }
    return 0;
}