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

using namespace std;

vector<int> v;
int n;
int main()
{
    ifstream fin ("elmaj.in");
    ofstream fout ("elmaj.out");
    fin >> n;
    v.resize(n);
    for (int i=0; i<n; i++)
    {
        fin >> v[i];
    }
    sort (v.begin(), v.end());
    int k=1, mx=0, a;
    for (int i=0; i<n-1; i++)
    {
        if (v[i]==v[i+1])
            k++;
        else
            k=1;
        if (k>mx)
        {
            mx=k;
            a=v[i];
        }
    }
    fout << a << " " << mx;
    return 0;
}