#include <bits/stdc++.h>
using namespace std;
long long modinv(long long a) {
  long long b = ((int)1e9 + 7), u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= ((int)1e9 + 7);
  if (u < 0) u += ((int)1e9 + 7);
  return u;
}
long long exp(long long a, long long b) {
  long long sum = a;
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = (res * sum) % ((int)1e9 + 7);
    }
    sum = (sum * sum) % ((int)1e9 + 7);
    b >>= 1;
  }
  return res;
}
int main() {
  int count[8] = {0};
  int num[] = {400, 800, 1200, 1600, 2000, 2400, 2800, 9999};
  int N;
  cin >> N;
  for (int i = 0; i < (N); ++i) {
    int d;
    cin >> d;
    for (int j = 0; j < (8); ++j) {
      if (num[j] > d) {
        ++count[j];
        break;
      }
    }
  }
  int sum = 0;
  for (auto &i : (count)) {
    if (i) ++sum;
  }
  cout << sum << " " << sum + (count[7] ? count[7] - 1 : 0) << endl;
  return 0;
}
