#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define INF 999999999999999999
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
using namespace std;
int main(int argc, char const *argv[])
{
    int n, t = 0, c = 0;
    cin >> n;
    vector<int> v(n, 0);
    rep(i, n)
    {
        cin >> v[i];
    }
    vector<int> cnt(8, 0);
    rep(i, v.size())
    {
        rep(j, cnt.size())
        {
            if (v[i] < (j + 1) * 400)
            {
                cnt[j]++;
                break;
            }
        }
        if (v[i] >= 3200)
            cnt++;
    }
    rep(i, num.size())
    {
        if (num[i] > 0)
            c++;
    }
    if (c != 0)
        cout << c << " " << c + t << endl;
    else
        cout << 1 << " " << t << endl;
    return 0;
}