#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < (N); ++i) cin >> A.at(i);
  map<int, int> res;
  for (int i = 0; i < (N); ++i) {
    if (1 <= A.at(i) && A.at(i) < 400) {
      if (res.count(0))
        res[0]++;
      else
        res[0] = 1;
      continue;
    }
    for (int j = 1; j <= 7; j++) {
      if (400 * j <= A.at(i) && A.at(i) < 400 * (j + 1)) {
        if (res.count(j))
          res[j]++;
        else
          res[j] = 1;
        break;
      }
    }
    if (A.at(i) >= 3200) {
      if (res.count(8))
        res[8]++;
      else
        res[8] = 1;
    }
  }
  int max_ = -1;
  int min_ = 1e5;
  int kind = 0;
  for (auto x : res) {
    if (x.first != 8) kind++;
  }
  cout << kind << " ";
  kind += res[8];
  if (kind > 7) kind = 7;
  cout << kind << endl;
}
