#define _CRT_SECURE_NO_WARNINGS

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<utility>
#include<cstdlib>
#include<iterator>
#include<queue>
#include<stack>
#define int long long
using namespace std;
typedef long long llong;
typedef unsigned long long ullong;
typedef unsigned int uint;
const int INF = 9223372036854775806;


namespace G {
}

int rate[] = { 399,799,1199,1599,2399,2799,3199 };
int map[8]{ 0 };

int solve(int n) {
	if (n <= 399) return 0;
	else if (n <= 799) return 1;
	else if (n <= 1199)return 2;
	else if (n <= 1599) return 3;
	else if (n <= 2399)return 4;
	else if (n <= 2799) return 5;
	else if (n <= 3199) return 6;
	else return 7;
}

signed main() {
	int ans = 0;
	int n;
	cin >> n;
	for (int i = 0; i < n; ++i) {
		int ngo;
		int index;
		cin >> ngo;
		index = solve(ngo);
		if ((map[index] == 0) && (index != 7)) {
			ans += 1;
			map[index] = 1;
		}
		else if (index == 7) {
			ans += 1;
			map[index] += 1;
		}
	}
	
	
	if (ans - map[7] == 0) cout << 1 << " " << ans << endl;
	else cout << ans - map[7] << " " << ans << endl;

	return 0;
}