#include <fstream>
#include <algorithm>
using namespace std;
long long n,v[1000002],i,mx,k,l,y;
int main()
{
    ifstream f ("elmaj.in");
    ofstream g ("elmaj.out");
    f>>n;
    for (i=1;i<=n;i++) f>>v[i];
    sort (v+1,v+n+1);
    for (i=1;i<=n/2;i++)
    {
        if (v[i]==v[n/2+i])
        {
            mx=v[i]; k=n/2;
            for (y=n/2+i;y<=n;y++)
            {
                if (v[i]==v[y]) k++;
                else break;
            }
        }
    }
    if (k==0) g<<"-1";
    else g<<mx<<" "<<k;
    return 0;
}