#include <fstream>
#include <algorithm>

using namespace std;

long long n,k,s,v[1000001],nr,mx,vm;

double sval;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
   f>>n;
   for(int i=1;i<=n;i++) f>>v[i];
   sort(v+1,v+n+1); nr=1;
   for(int i=2;i<=n;i++)
   { if(v[i]==v[i-1]) nr++;
   else {if(nr>mx) {mx=nr; vm=v[i-1];}
   nr=1;

   }}
   if(nr>mx) {mx=nr; vm=v[n];}
   g<<vm<<" "<<mx;







    return 0;
}