#include <bits/stdc++.h>
using namespace std;
const int mod7 = 1e9 + 7;
const int mod9 = 1e9 + 9;
const int inf = 1 << 30;
const int64_t INF = 1LL << 60;
template <typename T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : abs(a);
}
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <typename T>
bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}
int main() {
  int n;
  cin >> n;
  int tourist = 0;
  set<int> c;
  for (int i = 0; i < (int)(n); i++) {
    int a;
    cin >> a;
    for (int i = 1; i < 8; i++) {
      if (a < 400 * i) {
        c.insert(i - 1);
        break;
      }
      if (a == 400 * i) {
        c.insert(i);
        break;
      }
    }
    if (a >= 3200) tourist++;
  }
  for (auto i : c) cerr << i << endl;
  cerr << tourist << endl;
  cout << c.size() << ' ' << c.size() + tourist << endl;
}
