#include <bits/stdc++.h>
using namespace std;
template <typename T>
T gcd(T m, T n) {
  return n == 0 ? m : gcd(n, m % n);
}
template <typename T>
T lcm(T m, T n) {
  return n * m / gcd(n, m);
}
template <typename T>
T fact(T n) {
  return (n == 0 ? 1 : n * fact(n - 1));
}
template <typename T>
T modpow(T a, T e, T m) {
  return (e == (T)0 ? 1 : ((a % m) * modpow((a % m), e - 1, m)) % m);
}
constexpr long long MOD = 1e9 + 7;
signed main(void) {
  long long num;
  long long n;
  cin >> n;
  map<long long, long long> mem;
  for (long long i = 0; i < n; ++i) {
    long long a;
    cin >> a;
    mem[a / 400]++;
  }
  num = 0;
  for (long long j = 0; j < 8; ++j) {
    if (mem[j] > 0) ++num;
  }
  long long m = num;
  long long M = num;
  if (mem[8] > 0) {
    if (m == 0) ++m;
    M += mem[8];
    num = min(M, (long long)8);
  }
  cout << m << " " << M << endl;
}
