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

using namespace std;

#define maxN 1000005

int N , x[maxN];

int main()
{
    ifstream f ("elmaj.in");
    ofstream g ("elmaj.out");

    f >> N;

    for (int i = 1 ; i <= N ; ++i)
        f >> x[i];

    sort (x + 1 , x + N + 1);

    int k = 1 , sol , maxim = 0;

    for (int i = 2 ; i <= N ; ++i)
        if (x[i] == x[i - 1])
            ++k;

        else {
            if (k > maxim)
            {
                maxim = k;
                sol = x[i - 1];
            }

            k = 1;
        }

    g << sol << " " << maxim;

    return 0;
}