#include <iostream>
#include <fstream>>
#include <unordered_map>

using namespace std;

ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");

unordered_map<int, int> m;
int n;
int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
    {
        int elem;
        fin>>elem;
        m[elem]++;
    }
    bool afis=0;
    for(auto it=m.begin(); it!=m.end(); ++it)
    {
        if(it->second>=n/2+1)
        {
            fout<<it->first<<" "<<it->second;
            afis=1;
            break;
        }
    }
    if(afis==0) fout<<-1;
    return 0;
}