#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,v[1000001],ok,nr,p,mx;
int main()
{
    f>>n;
    for(int i=1;i<=n;i++) f>>v[i];
        sort(v+1,v+n+1);
    nr=1;
    for (int i=2;i<=n;i++){
        if(v[i]==v[i-1]) nr++;
        else {if(nr>mx) {mx=nr; p=v[i-1];} nr=1;}
    }
    if(nr>mx) {mx=nr; p=v[n-1];}
    if(mx>=2/n+1) g<<p<<" "<<mx;
    else g<<-1;
    return 0;
}