#include <iostream>
#include <queue>
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;

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

int n;
priority_queue < int > Money;

int main() {
    fin >> n;
    for(int i = 1; i <= n; i ++) {
        int x;
        fin >> x;
        Money.push(x);
    }
    int curent = Money.top(), aparitii = 0;
    int maxim = 1, nrMax = curent;
    while(!Money.empty()) {
        if(curent != Money.top()) {
            if(aparitii >= maxim) {
                maxim = aparitii;
                nrMax = curent;
            }
            aparitii = 0;
            curent = Money.top();
        }
        aparitii ++;
        Money.pop();
    }
    if(aparitii >= maxim) {
        fout << curent << " " << aparitii;
    } else {
        fout << nrMax << " " << maxim;
    }
}