//#include<bits/stdc++.h>
#include<iostream>
#include<cmath>
#include<cstdio>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<utility>
#include<algorithm>
#include<cstring>
#include<sstream>
#include <iomanip>

using namespace std;

typedef long long ll ;
typedef double db;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector< pair<int,int> > vii;
const double pi = 2*acos(0) ;

#define pf		  	printf
#define sf			  scanf
#define pb(a)         push_back(a)
#define mp			make_pair
#define fi			 first
#define se			 second
#define for0(i,n)        for(int i=0;i<n;i++)
#define for1(i,n)        for(int i=1;i<=n;i++)
#define forab(i,a,b)       for(int i=a;i<=b;i++)
#define lcm(a, b)     ((a)*((b)/gcd(a,b)))
#define sq(a)		   (a)*(a)
#define nw				"\n"
#define abs(x)		fabs(x)
#define pcase(z,x)    cout<<"Case "<<z<<": "<<x<<"\n"
int main()
{
	int n,x,ans=0;
	cin>>n;
	vi c(9,0);
	for0(i,n){
		cin>>x;
		if(x>=1 && x<400�) c[0]++;
		else if(x>=400 && x<800) c[1]++;
		else if(x>=800 && x<1200) c[2]++;
		else if(x>=1200 && x<1600) c[3]++;
		else if(x>=1600 && x<2000) c[4]++;
		else if(x>=2000 && x<2400) c[5]++;
		else if(x>=2400 && x<2800) c[6]++;
		else if(x>=2800 && x<3200) c[7]++;
		else c[8]++;
		}
	for0(i,8){
		if(c[i]>0) ans++;
		}
	cout<<ans<<" "<<ans+c[8]<<nw;
	
	return 0;
}