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

using namespace std;


int main()
{
    ifstream fin("arc.in");
    ofstream fout("arc.out");
    int v[100001],i,n,l=1,max1=0,x;
    fin>>n;
    for (i=1; i<=n; i++)
        fin>>v[i];

    //for (i=1; i<=n; i++)
    //  cout<<v[i];

    sort(v+1,v+n+1 );

    for(i=1; i<=n-1; i++)
    {
        if(v[i]==v[i+1])
        {
            l++;
            if(l>max1)
            {
                max1=l;
                x=v[i];
            }
        }
            else

            {
                l=1;
            }



    }
    fout<<x<<" "<<max1;
}