//15:32
#include <stdio.h>
#include <string.h>
#include <algorithm>

typedef long long ll;
ll max(ll a, ll b){return(a>b)?a:b;}
ll min(ll a, ll b){return(a<b)?a:b;}
ll abs(ll a){return(a<0)?-a:a;}

ll gcd(ll a, ll b){
        if(b > a){
                ll tmp = b;
                b = a;
                a = tmp;
        }
        if(b == 0) return a;
        else return gcd(b, a%b);
}
ll lcm(ll a, ll b){
        ll gcdi = gcd(a,b);
        return a/gcdi*(b);
}

#define MOD (1000000000+7)
int main(){
        int N;
        scanf("%d",&N);

        char cnt[8];
        memset(cnt,0,sizeof(cnt));
        int score;
        int cnt32 = 0;

        for(int i = 0; i < N; i++){
                scanf("%d",&score);
                if(score >= 3200) cnt32++;
                else cnt[score/400] = 1;
        }
        int total = 0;
        for(int i = 0; i < 8; i++){
                total += cnt[i];
        }
        printf("%d %d\n", total, total+cnt32);
}