#include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
const double EPS = 1e-10;
const double PI = acos(-1.0);
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long g = gcd(a, b);
  return a / g * b;
}
int main() {
  int N;
  cin >> N;
  int a[N];
  for (int i = (0); i < (N); ++i) cin >> a[i];
  sort(a, a + N);
  int num[8] = {0};
  int act = 0;
  int res = 0;
  int nokori = 0;
  int tmp = 0;
  while (res < 8) {
    for (int i = tmp; i < N; ++i) {
      if (a[i] < (res + 1) * 400 && a[i] >= res * 400) {
        num[res] = num[res] + 1;
        ++act;
      } else {
        tmp = i;
        break;
      }
    }
    ++res;
  }
  nokori = N - act;
  int color = 0;
  for (int i = (0); i < (8); ++i) {
    if (num[i] > 0) {
      ++color;
    }
  }
  int num_max = 0, num_min = 0;
  num_min = color;
  num_max = color + nokori;
  if (num_max > 8) {
    num_max = 8;
  }
  cout << num_min << " " << num_max;
}
