#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long modinv(long long a, long long m) {
  long long b = m, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= m;
  if (u < 0) u += m;
  return u;
}
vector<pair<long long, long long>> prim;
void pf(long long n) {
  long long s = sqrt(n);
  long long r = 0;
  for (long long i = 2; i <= s; i++) {
    if ((n % i) == 0) {
      r = 0;
      do {
        r++;
        n = n / i;
      } while ((n % i) == 0);
      prim.push_back({i, r});
    }
  }
  if (n > s) {
    prim.push_back({n, 1});
  }
}
long long pnt[] = {1, 400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
void solve() {
  long long N;
  cin >> N;
  vector<long long> a(N);
  for (long long i = 0; i < (N); i++) cin >> a[i];
  long long ans1 = 0;
  long long ans2 = 0;
  vector<long long> cnt(8, 0);
  long long ov3200 = 0;
  for (long long i = 0; i < (N); i++) {
    for (long long j = 0; j < (8); j++) {
      if (pnt[j] <= a[i] && a[i] < pnt[j + 1]) cnt[j] = 1;
    }
    if (a[i] >= 3200) ov3200++;
  }
  for (long long i = 0; i < (8); i++) ans1 += cnt[i];
  if (ans1 == 0 && ov3200 > 0) ans1 = 1;
  ans2 = ans1 + ov3200;
  cout << ans1 << " " << ans2 << endl;
}
int main(void) { solve(); }
