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

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

int x[1000001];

int main()
{
    int n,max1,maxtt=0,z;
    in>>n;
    for(int i=0;i<n;i++)
        in>>x[i];
    sort(x,x+n);
    for(int i=0;i<n;i++)
    {max1=1;
    while(x[i]==x[i+1])
    {
        max1++;
        i++;
    }
    if(max1>maxtt){maxtt=max1;z=x[i];}
    }
    if(maxtt>=n/2+1)out<<z<<' '<<maxtt;
    return 0;
}