#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {

	const int p = 8;
	int n; cin >> n;
	vector<int> num(p + 1, 0);
	int free = 0;
	for (int i = 0; i < n; i++) {
		int a; cin >> a;
		for (int j = 1; j <= p; j++) {
			if (400 * (j - 1) <= a && a < 400 * j) {
				num[j] = 1;
			}
		}
		if (400 * p <= a) free++;
	}
	int ans = 0;
	for (int i = 0; i < p + 1; i++) {
		if (1 == num[i]) ans++;
	}
	cout << ans << " " << ans + free << endl;
	return 0;
}#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {

	const int p = 8;
	int n; cin >> n;
	vector<int> num(p + 1, 0);
	int free = 0;
	for (int i = 0; i < n; i++) {
		int a; cin >> a;
		for (int j = 1; j <= p; j++) {
			if (400 * (j - 1) <= a && a < 400 * j) {
				num[j] = 1;
			}
		}
		if (400 * p <= a) free++;
	}
	int ans = 0;
	for (int i = 0; i < p + 1; i++) {
		if (1 == num[i]) ans++;
	}
	cout << ans << " " << ans + free << endl;
	return 0;
}