#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int v[1000000];
int main()
{
    int n;
    in>>n;
    for(int i=0;i<n;++i)
        in>>v[i];
    sort(v, v+n);
    int celem=v[0], maj=-1, majn=n/2+1, ap=1, nap=0;
    for(int i=1;i<n;i++)
    {
        if(v[i]!=celem)
        {
            celem=v[i];
            ap=1;
        }
        else
        {
            ap++;
            if(ap==majn)
            maj=celem, nap=ap;
            else
            if(celem==maj)
            nap++;
        }
    }
    out<<maj<<" "<<nap<<"\n";
    return 0;
}