#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

#define nmax

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

vector< int > a;
int n,x,ok;
int main()
{
    fin>>n;
    for(int i = 1; i <= n ; i++)
        {
            fin>>x;
            a.push_back(x);
        }
    sort(a.begin(),a.end());
    int i=0;
    while(i < n )
    {
        int  j = i ;
         while( j < n  && a[j+1]==a[i])
            j++;
         if(j-i+1 > n / 2 )
            {
                ok=1;
                fout<< a[i]<<" "<<j-i+1<<'\n';
                return 0;
            }
         i=j+1;
    }
    if(!ok) fout<<-1;


    return 0;
}