#include <iostream>
#include <fstream>
#include <algorithm>
#include <climits>

int a[10000];

using namespace std;

int main()
{  ifstream fin("date.in");
   ofstream fout("date.out");
   int n,m=1,j=0,i,ok=0,M=0,k=0;
   fin>>n;
   for (i=1;i<=n;i++)
   fin>>a[i];
   j=INT_MIN;
   sort (a+1,a+1+n);
   for (i=2;i<=n;i++)
   {

        if (a[i]==a[i-1]) m++;

        else m=1;
        if (m>j) {j=m;
                  k=a[i];}}
    if (m==INT_MIN) fout<<"-1";
    else fout<<k<<" "<<j;





















    return 0;
}