#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int v[1000010];
int main()
{
    int n, i, nrap = 1, maj;
    fin >> n;
    for(i = 1;i <= n;i++)
        fin >> v[i];
    sort(v + 1, v + n + 1);
    maj = n / 2 + 1;
    for(i = 1;i <= n;i++)
    {
        if(v[i] == v[i + 1])
            nrap++;
        else
            if(v[i] != v[i+1] && nrap >= maj)
            {
                fout << v[i] << " " << nrap;
                return 0;
            }
        else
            nrap = 1;

    }
    return 0;
}