#include <cstdio>
#include <algorithm>

using namespace std;
int v[1000002];
int main()
{
    freopen("elmaj.in","r",stdin);
    freopen("elmaj.out","w",stdout);
    int a,n,l=0,lmax=0,x;
    scanf("%d",&n);
    for(int i=1; i<=n; i++)
        scanf("%d",&v[i]);
    sort(v+1,v+n+1);
    for(int i=1; i<=n; i++)
    {
        l++;
        if(v[i]!=v[i+1])
        {
            if(lmax<l)
            {
                lmax=l;
                x=v[i];
            }
            l=0;
        }
    }
    if(lmax>n/2)
    printf("%d %d",x,lmax);
    else
        printf("-1");
    return 0;
}