#include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define INF LLONG_MAX
#define eps LDBL_EPSILON
#define moder 1000000007
#define pie 3.141592653589793238462643383279
#define P std::pair<int,int>
#define prique priority_queue
using namespace std;
int n,a;
set<int> st;
signed main(){
	cin>>n;
	int ans=0;
	rep(i,n){
		cin>>a;
		if(a>=3200)ans++;
		else st.insert(a/400);
	}
	cout<<max(1,st.size())<<" "<<st.size()+ans<<endl;
	return 0;
}