#include<iostream>
#include<vector>
#include<stack>
#include<algorithm>
#include<string>
#include<set>
#include<numeric>
#include<functional>
#include<unordered_map>
using namespace std;

int main()
{
    int N;
    cin >> N;
    int color[8];
    for (int i = 0; i < 8; i++)
        color[i] = 0;

    int free = 0;

    vector<int> a(N);

    for (int i = 0; i < N; i++) {
        cin >> a[i];
        if (0 <= a[i] && a[i] < 400)
            color[0]++;
        else if (400 <= a[i] && a[i] < 800)
            color[1]++;
        else if (800 <= a[i] && a[i] < 1200)
            color[2]++;
        else if (1200 <= a[i] && a[i] < 1600)
            color[3]++;
        else if (1600 <= a[i] && a[i] < 2000)
            color[4]++;
        else if (2000 <= a[i] && a[i] < 2400)
            color[5]++;
        else if (2400 <= a[i] && a[i] < 2800)
            color[6]++;
        else if (2800 <= a[i] && a[i] < 3200)
            color[7]++;
        else if (3200 <= a[i])
            free++;
    }
    int min_ = 0, max_;
    for (int i = 0; i < 8; i++) {
        if (color[i] > 0) min_++;
    }
    min_ max(min_, 1);
    max_ = min_ + free;
    printf("%d %d\n", min_, max_);}
