#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
using Graph = vector<vector<int>>;
using Edge = map<pair<int, int>, int>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}
long long gcd(long long a, long long b) {
  if (a % b == 0)
    return (b);
  else
    return (gcd(b, a % b));
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
int main() {
  cout << fixed << setprecision(15);
  long long N;
  cin >> N;
  vector<long long> C(9, 0);
  for (long long i = 0; i < (long long)(N); ++i) {
    long long a;
    cin >> a;
    if (a < 400) {
      C[0]++;
      continue;
    }
    if (a < 800) {
      C[1]++;
      continue;
    }
    if (a < 1200) {
      C[2]++;
      continue;
    }
    if (a < 1600) {
      C[3]++;
      continue;
    }
    if (a < 2000) {
      C[4]++;
      continue;
    }
    if (a < 2400) {
      C[5]++;
      continue;
    }
    if (a < 2800) {
      C[6]++;
      continue;
    }
    if (a < 3200) {
      C[7]++;
      continue;
    }
    if (a >= 3200) {
      C[8]++;
      continue;
    }
  }
  long long min_ans = 0;
  long long max_ans = 0;
  for (long long i = 0; i < (long long)(8); ++i) {
    if (C[i] > 0) min_ans++;
  }
  if (min_ans == 0) {
    cout << 1 << " " << C[8] << endl;
  }
  max_ans = min(long long(8), min_ans + C[8]);
  cout << min_ans << " " << max_ans << endl;
  return 0;
}
