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