#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[1000002];
int main()
{
    int n,i;
    fin>>n;
    for(i=1;i<=n;i++) fin>>v[i];
    sort(v+1,v+n+1);
    int maxim=0;
    int element=0;
    int lung=1;int  el=v[1]; i=2;
    while(i<=n)
    {
        while(v[i]==el) {lung++;i++;}
        if(v[i]!=el &&lung>maxim )
        {
            maxim=lung;
            element=el;
            el=v[i];lung=1;i++;
        }
    }
    fout<<element<<" "<<maxim;
}