#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);
 
#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)
 
int n, a;
int cnt[9];
 
int main(int argc, char **argv) {
	cin >> n;
	clear(cnt);
	REP(i, n) {
		cin >> a;
		++cnt[min(3200, a) / 400];
	}
	int res = 0;
	REP(i, 8) if (cnt[i] != 0) ++res;
	if (res == 0)  cout << (cnt[8] != 0 ? 1 : 0) << ' ' << min(8, cnt[8]) << endl;
	else cout << res << ' ' << min(8, res + cnt[8]) << endl;
	return 0;
}