#include <cstdio>
using namespace std;
int v[1000005];
void qsort(int v[], int lo, int hi)
{
    int i=lo,j=hi,t,pivot=v[lo+(hi-lo)/2];
    while (i<=j)
    {
        while (pivot>v[i])
            ++i;
        while (pivot<v[j])
            --j;
        if (i<=j)
        {
            t=v[i];
            v[i]=v[j];
            v[j]=t;
            ++i;
            --j;
        }
    }
    if (i<hi)
        qsort(v,i,hi);
    if (lo<j)
        qsort(v,lo,j);
}
int main()
{
    int i,n,y;
    freopen("elmaj.in","r",stdin);
    freopen("elmaj.out","w",stdout);
    scanf("%d\n",&n);return 0;
    for (i=1;i<=n;++i)
        scanf("%d ",&v[i]);
    qsort(v,1,n);
    for (i=1;i<=n;++i)
    {
        for (y=i+1;y<=n;++y)
            if (v[y]!=v[i])
                break;
        if (y-i>=n/2)
        {
            printf("%d %d\n",v[i],y-i);
            fclose(stdin);
            fclose(stdout);
            return 0;
        }
        i=y;
    }
    printf("-1\n");
    fclose(stdin);
    fclose(stdout);
    return 0;
}