#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int  v[1000001];
int main()
{
    int n, k, i;
    fin>>n;
    for (int i=1;i<=n;++i)
        fin>>v[i];
    sort (v+1,v+n+1);
    for (i=1;i<=n/2;++i)
    {
        if (v[i]==v[(n+1)/2+i-1])
        {
            fout<<v[i]<<" ";
            k=(n+1)/2+i-1;
            while (v[i]==v[k+1] && k+1<=n)
                k++;
            fout<<k-i+1;
            break;
        }
    }
    if (i==n/2+1)
        fout<<-1;

}