#include <fstream>
#include <algorithm>
using namespace std;
int v[1000005];
int main()
{
    ifstream cin ("elmaj.in");
    ofstream cout ("elmaj.out");
    int n, cnt=0, maxx=0, maxcnt=0, k=0, i;
    cin>>n;
    for (int i=0; i<n; i++)
    {
        cin>>v[i];
    }
    sort (v, v+n);
    for (i=0; i<n; i++)
    {
        if (v[i]==k)
            cnt++;
        else
        {
            if (cnt>maxcnt)
            {
                maxcnt=cnt;
                maxx=v[i-1];
            }
            cnt=1;
            k=v[i];
        }
    }
    if (cnt>maxcnt)
            {
                maxcnt=cnt;
                maxx=v[i];
            }
    if (maxcnt>n/2)
       cout<<maxx<<" "<<maxcnt;
}