#include<cstdio>
#include<algorithm>
using namespace std;
int v[1000005];
int main()
{
    freopen("elmaj.in","r",stdin);
    freopen("elmaj.out","w",stdout);
    int n,i,nr=0,ok=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&v[i]);
    }
    sort(v+1,v+n+1);
    v[0]=v[1];
    for(i=1;i<=n;i++)
    {
        if(v[i]==v[i-1])
        nr++;
        else
        {
            if(nr>=(n/2)+1)
            {
                printf("%d %d",v[i-1],nr);
                ok=1;
                break;
            }
            nr=1;
            if(i>n-((n/2)+1))
            break;
        }
    }
    if(ok==0)
    printf("-1");
    return 0;
}