#include <iostream>
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g ("elmaj.out");
int maxi=-1;
int n,i,a[100000000];
int j,k,el;
int main()
{
    f>>n;
    for(i=1; i<=n; ++i)
        f>>a[i];
    sort(a+1,a+n+1);
i=1;
    while(i<=n)
    {
        j=i+1;
        k=1;
        while(j<=n && a[j]==a[i])
        {
            j++;
            k++;
        }

        if(maxi<k )
        {
            maxi=k;
            el=a[i];
        }
        i=j;
    }
    if(maxi>=n/2+1)
    g<<el<<" "<<maxi;
        else g<<-1;

    return 0;
}