#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("elmaj.in");
ofstream fout ("elmaj.out");

int v[1000005], n, cont, nr, maxim = -1;

int main()
{
    fin>>n;
    for(int i = 1; i <= n; i++){
        fin>>v[i];
    }
    sort(v + 1, v + n + 1);
    for(int i = 1; i <= n; i++){
        if(v[i] == v[i - 1]){
            cont++;
        }
        else{
            if(maxim < cont){
                maxim = cont;
                nr = v[i - 1];
            }
            cont = 1;
        }
    }
    fout<<nr<<" "<<maxim;
    return 0;
}