#include <cstdio>
#include <algorithm>
#include <fstream>

using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");

int n,i,nrap,nrmaxap;
long long a[1000000],numarul,majoritarul;

int main()
{
    //freopen("elmaj.in","r",stdin);
    //freopen("elmaj.out","w",stdout);
    //scanf("%d",&n);
    fin>>n;
    for (i=1; i<=n; i++) fin>>a[i];//scanf("%lld",&a[i]);
    sort(a+1,a+n+1);

    nrap=1;
    numarul=a[1];
    majoritarul=a[1];
    nrmaxap=1;
    for (i=2; i<=n; i++)
    {
        if (a[i]!=a[i-1])
        {
            if (nrmaxap<nrap) {majoritarul=numarul; nrmaxap=nrap;}
            nrap=1;
            numarul=a[i];
            if (nrmaxap>n/2) break;
        }
        else nrap++;
    }
    fout<<majoritarul<<" "<<nrmaxap;
    //printf("%lld %d",majoritarul,nrmaxap);
    return 0;
}