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