#include <fstream>
#include <unordered_map>
using namespace std;

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

unordered_map <int, int> myHash;

int main()
{
	int maxim = 0;

    int n; in >> n;
    for (int i = 0; i < n; ++i)
    {
        int x; in >> x;
		++myHash[x];

		if (myHash[x] > maxim)
			maxim = x;
    }
    
	out << maxim << " " << myHash[maxim] << "\n";
        
    return 0;
}