// UUID: b06e6fdb-51ad-4d4c-9649-5fc1d1e6bc54
#include <algorithm>
#include <bits/stdc++.h>
#include <numeric>
#include <vector>
using namespace std;

int main() {
	int n, centi; cin >> n;
	vector<int> szeletek(n + 1);
    for (int i = 0; i < n; i++) {
		cin >> centi;
		szeletek[centi]++;
	}
	int maxi = 0, maxszelet = 0;
	for (int i = 1; i < szeletek.size(); i++) {
		szeletek[i] /= i;
		if (szeletek[i] > maxszelet) {
			maxi = i;
			maxszelet = szeletek[i];
		}
	}
	cout << accumulate(szeletek.begin(), szeletek.end(), 0) << '\n' << 
			maxi;
}