#include <cstdio>
#include <algorithm>

using namespace std;

#define MAX 1000005

int v[MAX],n,fr=0,i,maxim=0,sol;
bool comp(int a, int b)
{
    return a<b;
}

int main()
{
    freopen("elmaj.in","r",stdin);
    freopen("elmaj.out","w",stdout);
    scanf("%d",&n);
    for(i=1; i<=n; i++)
    {
        scanf("%d",&v[i]);
        sort(v+1,v+n+1,comp);
    }
        //sort(v+1,v+n+1,comp);
    for(i=2; i<=n; i++)
    {
        if(v[i] == v[i-1])
            fr++;
        else
            fr=0;
        if(fr > maxim)
        {
            maxim=fr;
            sol=v[i];
        }
    }
    printf("%d %d",sol,maxim+1);
    return 0;
}