#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int a[100001],i,n,x,k,maxi=0;
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)fin>>a[i];
    sort(a+1,a+n+1);
    for(i=1;i<=n;i++)
   {
       if(a[i]==a[i+1])x++;
       else
       {
           if(x>maxi){maxi=x;k=a[i];}
            x=0;maxi++;
       }
   }
   if(maxi>n/2)fout<<k<<" "<<maxi-1;
   else fout<<-1;
    return 0;
}