#include <bits/stdc++.h>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
  std::fill((T*)array, (T*)(array + N), val);
}
void dump_func() {}
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&&... tail) {
  cerr << head;
  if (sizeof...(Tail) == 0) {
    cerr << " ";
  } else {
    cerr << ", ";
  }
  dump_func(std::move(tail)...);
}
template <typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
  os << "{";
  for (int i = 0; i < vec.size(); i++) {
    os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
  }
  os << "}";
  return os;
}
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
int main() {
  int n;
  cin >> n;
  int c[9] = {};
  int a;
  for (int i = 0; i < (int)(n); i++) {
    cin >> a;
    if (a <= 399) {
      c[0] += 1;
    } else if (a <= 799) {
      c[1] += 1;
    } else if (a <= 1199) {
      c[2] += 1;
    } else if (a <= 1599) {
      c[3] += 1;
    } else if (a <= 1999) {
      c[4] += 1;
    } else if (a <= 2399) {
      c[5] += 1;
    } else if (a <= 2799) {
      c[6] += 1;
    } else if (a <= 3199) {
      c[7] += 1;
    } else {
      c[8] += 1;
    }
  }
  int m = 0;
  for (int i = 0; i < (int)(8); i++) {
    if (c[i] > 0) {
      m++;
    }
  }
  if (m >= 1) {
    cout << m << " ";
  } else {
    cout << 1 << " ";
  }
  cout << min(m + c[8], 8) << endl;
  return 0;
}
