#include <bits/stdc++.h>
using namespace std;
template <unsigned int MD>
struct ModInt {
  using M = ModInt;
  const static M G;
  unsigned int v;
  ModInt(long long _v = 0) { set_v(unsigned int(_v % MD + MD)); }
  M& set_v(unsigned int _v) {
    v = (_v < MD) ? _v : _v - MD;
    return *this;
  }
  explicit operator bool() const { return v != 0; }
  M operator-() const { return M() - *this; }
  M operator+(const M& r) const { return M().set_v(v + r.v); }
  M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
  M operator*(const M& r) const {
    return M().set_v(unsigned int(unsigned long long(v) * r.v % MD));
  }
  M operator/(const M& r) const { return *this * r.inv(); }
  M& operator+=(const M& r) { return *this = *this + r; }
  M& operator-=(const M& r) { return *this = *this - r; }
  M& operator*=(const M& r) { return *this = *this * r; }
  M& operator/=(const M& r) { return *this = *this / r; }
  bool operator==(const M& r) const { return v == r.v; }
  M pow(long long n) const {
    M x = *this, r = 1;
    while (n) {
      if (n & 1) r *= x;
      x *= x;
      n >>= 1;
    }
    return r;
  }
  M inv() const { return pow(MD - 2); }
  friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
};
using Mint = ModInt<1000000007>;
const double PI = 3.14159265358979323846;
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
  if (a.second != b.second) {
    return a.second < b.second;
  } else {
    return a.first < b.first;
  }
}
bool is_prime(long long N) {
  if (N == 1) return false;
  for (long long i = 2; i * i <= N; ++i) {
    if (N % i == 0) return false;
  }
  return true;
}
int main() {
  long long n;
  cin >> n;
  vector<long long> v(n);
  for (long long(i) = 0; (i) < (n); (i)++) cin >> v[i];
  long long min_cnt = 0;
  long long max_cnt = 0;
  int bit = 0b00000000;
  for (long long(i) = 0; (i) < (n); (i)++) {
    for (int rate = 0; rate < 3200; rate += 400) {
      if (rate <= v[i] && v[i] < rate + 400) {
        int loop_cnt = (rate / 400) + 1;
        if (!(bit & (1 << loop_cnt - 1))) {
          min_cnt++;
          max_cnt++;
        }
        bit = bit | (1 << loop_cnt - 1);
      }
    }
    if (v[i] >= 3200) max_cnt++;
  }
  cout << min_cnt << " " << max_cnt << endl;
}
