#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <stdlib.h>
#include <stdio.h>

using namespace std;

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

int my_abs_A(int num) {
    if (num > 0)
        return num;
    else
        return -num;
}

int my_abs_B(long long num,long long numb) {
    if (num - numb >= 0)
        return num - numb;
    else
        return -1 * (num - numb);
}

long long gcd(long long a, long long b) {
    if (b == 0) return a;
    else return gcd(b, a % b);
}

long long lcm(long long a, long long b) {
    return a * b / gcd(a, b);
}

int main() {
    int N;
    cin >> N;
    vector<int> rate(N);
    for (int i = 0; i < N; i++) {
        cin >> rate.at(i);
    }
    vector<int> color(9);
    for (int j = 0; j < N; j++) {
        if (color.at(rate.at(j) / 400) <= 8) {
            (color.at(rate.at(j) / 400)++;
        }
        else {
            color.at(8)++;
        }
    }
    int ansM = 0;
    int ansS = 0;
    for (int k = 0; k < 9; k++) {
        if (k == 8) {
            if (color.at(k) > ansM && color.at(8) > ansM) {
                ansS = ansS + (color.at(8) - ansM);
            }
            ansM = ansM + color.at(8);
            break;
            
        }
        if (color.at(k) > 0) {
            ansM++;
            ansS++;
        }
    }
    cout << ansS << " " << ansM << endl;

}