#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
int n;
int min, max;
int a[122];
int res[122];
bool flg[122];
int main() {
while(~scanf("%d",&n)) {
memset(flg,0,sizeof(flg));
int cnt = 0;
for(int i=1; i<=n;i++) scanf("%d", &a[i]);
for(int i=1;i<=n;i++) {
if(a[i]>=1 && a[i] <= 399) res[i]=1;
else if(a[i] >=400 && a[i] <= 799) res[i]=2;
else if(a[i] >=800 && a[i] <=1199) res[i]=3;
else if(a[i] >= 1200 && a[i] <= 1599) res[i]=4;
else if(a[i] >= 1600 && a[i] <= 1999) res[i]=5;
else if(a[i] >= 2000 && a[i] <= 2399) res[i]=6;
else if(a[i] >= 2400 && a[i] <= 2799) res[i]=7;
else if(a[i] >= 2800 && a[i] <= 3199) res[i]=8;
}
for(int i=1; i <=n; i++){
if(flg[res[i]] == 0) {
flg[res[i]] =1;
cnt++;
}
}
min=cnt;
int t=0;
for(int i=1; i <= n; i++){
if(a[i] >= 3200) t++;
}
max=cnt + t;
printf("%d %d\n",min, max);
}
}