#include <cstdio>
#include <algorithm>

using namespace std;

int a[1000001],j,i,n,bl;

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);
        i=1;
        while (i<=n)
            {
                j=i;
                while (j<=n && a[j+1]==a[i]) j++;
                if (j-i+1>=n/2+1)
                    {
                        printf("%d %d\n",a[i],j-i+1); bl=74;
                        break;
                    }
                i=j+1;
            }
        if (bl!=74) printf("-1");
    }