#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int main() {
	int n;
	cin >> n;
	vector<int> A;
	for (int i = 0; i < n; ++i){
		int a;
		cin >> a;
		A.push_back(a);
	}
	sort(A.begin(), A.begin() + n);
	for (int i = 0; i < n; ++i){
		cout << A[i] << " ";
	}
 
	int count_max = 0;
	for (int i = 0; i < n; ++i){
		int m = 1;
		if (A[i] = A[i+1]){
			m = m + 1;
			if (m > count_max){
				count_max = m;
			}
		}
		else {
			break;
		}
	}
	cout << count_max << endl;
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgbjsKCWNpbiA+PiBuOwoJdmVjdG9yPGludD4gQTsKCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgKytpKXsKCQlpbnQgYTsKCQljaW4gPj4gYTsKCQlBLnB1c2hfYmFjayhhKTsKCX0KCXNvcnQoQS5iZWdpbigpLCBBLmJlZ2luKCkgKyBuKTsKCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgKytpKXsKCQljb3V0IDw8IEFbaV0gPDwgIiAiOwoJfQoJCglpbnQgY291bnRfbWF4ID0gMDsKCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgKytpKXsKCQlpbnQgbSA9IDE7CgkJaWYgKEFbaV0gPSBBW2krMV0pewoJCQltID0gbSArIDE7CgkJCWlmIChtID4gY291bnRfbWF4KXsKCQkJCWNvdW50X21heCA9IG07CgkJCX0KCQl9CgkJZWxzZSB7CgkJCWJyZWFrOwoJCX0KCX0KCWNvdXQgPDwgY291bnRfbWF4IDw8IGVuZGw7CglyZXR1cm4gMDsKfQ==

NyAxIDMgMiAzIDQgMyAzIA==

7 1 3 2 3 4 3 3