#include <bits/stdc++.h>
const int LG = 21;
const int FN = 400005;
const long long MOD = 998244353;
const long long INF = 1e9;
const long long INFLL = 1e18;
using namespace std;
long long cx[4] = {-1, 0, 1, 0};
long long cy[4] = {0, -1, 0, 1};
string Yes[2] = {"No", "Yes"};
string YES[2] = {"NO", "YES"};
long long inq(long long x, long long y) {
  if (!y) return 1 % MOD;
  long long l = inq(x, y / 2);
  if (y % 2) return l * l % MOD * x % MOD;
  return l * l % MOD;
}
long long rev(long long x) { return inq(x, MOD - 2); }
bool __precomputed_combinatorics = 0;
vector<long long> __fact, __ufact, __rev;
void __precompute_combinatorics() {
  __precomputed_combinatorics = 1;
  __fact.resize(FN);
  __ufact.resize(FN);
  __rev.resize(FN);
  __rev[1] = 1;
  for (long long i = 2; i < FN; i++)
    __rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
  __fact[0] = 1, __ufact[0] = 1;
  for (long long i = 1; i < FN; i++)
    __fact[i] = __fact[i - 1] * i % MOD,
    __ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
long long fact(long long x) {
  if (!__precomputed_combinatorics) __precompute_combinatorics();
  return __fact[x];
}
long long cnk(long long n, long long k) {
  if (k < 0 || k > n) return 0;
  if (!__precomputed_combinatorics) __precompute_combinatorics();
  return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
long long Root(long long x, vector<long long> &root) {
  if (x == root[x]) return x;
  return root[x] = Root(root[x], root);
}
void Merge(long long v, long long u, vector<long long> &root,
           vector<long long> &sz) {
  v = Root(v, root), u = Root(u, root);
  if (v == u) return;
  if (sz[v] < sz[u]) {
    sz[u] += sz[v];
    root[v] = u;
  } else {
    sz[v] += sz[u];
    root[u] = v;
  }
}
long long ok(long long x, long long n) { return 0 <= x && x < n; }
void bfs(long long v, vector<long long> &dist,
         vector<vector<long long> > &graph) {
  fill((dist).begin(), (dist).end(), -1);
  dist[v] = 0;
  vector<long long> q = {v};
  for (long long i = 0; i < q.size(); i++) {
    for (auto u : graph[q[i]]) {
      if (dist[u] == -1) {
        dist[u] = dist[q[i]] + 1;
        q.push_back(u);
      }
    }
  }
}
long long log10(long long x) {
  if (x < 10) return 1;
  return 1 + log10(x / 10);
}
long long sqr(long long x) { return x * x; }
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<long long> cnt(10);
  long long aa = 0;
  for (long long i = 0; i < n; i++) {
    long long x;
    cin >> x;
    if (x < 3200) {
      cnt[x / 400]++;
    } else {
      aa++;
    }
  }
  if (aa == n) {
    cout << 1 << " " << min(n, 8ll);
    return 0;
  }
  long long x = 0;
  for (long long i = 0; i < 8; i++) x += cnt[i] > 0;
  cout << x << " " << min(8ll, x + aa);
}
