#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <map>
#include <stack>
using namespace std;

int main() {
	int n, num, mi = 0, max = 0;
	cin >> n;
	vector <int> a(8);
	for (int i = 0; i < n; i++) {
		cin >> num;
	}
	for (int i = 0; i < n; i++) {
		if (num / 400 < 8) {
			a[num / 400]++;
		}
		else {
			max++;
		}
		for (int i = 0; i < 8; i++) {
			if (a[i] > 0) {
				mi++;
			}
		}
		if (mi != 0) {
			cout << mi << " " << mi + max << endl;
		}
		else {
			cout << min(mi, max) << " " << mi + max << endl;
		}
		return 0;
}