#include <bits/stdc++.h>
using namespace std;
template <typename _KTy, typename _Ty>
ostream& operator<<(ostream& ostr, const pair<_KTy, _Ty>& m) {
  ostr << "{" << m.first << ", " << m.second << "}";
  return ostr;
}
template <typename _KTy, typename _Ty>
ostream& operator<<(ostream& ostr, const map<_KTy, _Ty>& m) {
  if (m.empty()) {
    ostr << "{ }";
    return ostr;
  }
  ostr << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    ostr << ", " << *itr;
  }
  ostr << "}";
  return ostr;
}
template <typename _Ty>
ostream& operator<<(ostream& ostr, const vector<_Ty>& v) {
  if (v.empty()) {
    ostr << "{ }";
    return ostr;
  }
  ostr << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    ostr << ", " << *itr;
  }
  ostr << "}";
  return ostr;
}
template <typename _Ty>
ostream& operator<<(ostream& ostr, const set<_Ty>& s) {
  if (s.empty()) {
    ostr << "{ }";
    return ostr;
  }
  ostr << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    ostr << ", " << *itr;
  }
  ostr << "}";
  return ostr;
}
template <typename _Ty>
ostream& operator<<(ostream& ostr, const stack<_Ty>& s) {
  if (s.empty()) {
    ostr << "{ }";
    return ostr;
  }
  stack<_Ty> t(s);
  ostr << "{" << t.top();
  t.pop();
  while (!t.empty()) {
    ostr << ", " << t.top();
    t.pop();
  }
  ostr << "}";
  return ostr;
}
template <typename _KTy, typename _Ty>
istream& operator>>(istream& istr, pair<_KTy, _Ty>& m) {
  istr >> m.first >> m.second;
  return istr;
}
template <typename _Ty>
istream& operator>>(istream& istr, vector<_Ty>& v) {
  for (size_t i = 0; i < v.size(); i++) istr >> v[i];
  return istr;
}
long long modpow(long long n, long long p, long long m) {
  long long result = 1;
  while (p > 0) {
    if (p & 1) result = (result * n) % m;
    p >>= 1;
    n = (n * n) % m;
  }
  return result;
}
template <typename _Ty>
_Ty ipow(_Ty x, _Ty n) {
  _Ty ret = _Ty(1);
  for (_Ty i = _Ty(0); i < n; i++) ret *= x;
  return ret;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T& val) {
  std::fill((T*)array, (T*)(array + N), val);
}
void dump_func() { cout << endl; }
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&&... tail) {
  cout << head;
  if (sizeof...(Tail) == 0) {
    cout << " ";
  } else {
    cout << ", ";
  }
  dump_func(std::move(tail)...);
}
int main() {
  int color[9] = {};
  int N;
  cin >> N;
  for (int i = (0); i < (N); ++i) {
    int a;
    cin >> a;
    if (a >= 3200)
      color[8]++;
    else {
      color[a / 400] = 1;
    }
  }
  int x, y;
  x = accumulate(color, color + 8, 0);
  x = (x == 0 ? 1 : x);
  y = x + color[8];
  cout << x << " " << y << endl;
  return 0;
}
