#include <fstream>
#include<algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long n,a[1000001],s,maxim,maximi,i;
int main()
{
   f>>n;
   for(i=1;i<=n;i++)
    f>>a[i];
    sort(a+1,a+n+1);
    for(i=1;i<=n;i++)
    {
        while(a[i]==a[i+1])
 {s++;
 i++;}
 if(s+1>maxim)
 {maxim=s+1;
   maximi=a[i];
 }

 s=0;

    }

    g<<maximi<<" "<<maxim;
    return 0;
}