#include <bits/stdc++.h>
using namespace std;
int H, W;
int seen[10000][10000];
char S[10000][10000];
vector<pair<long long, long long>> prime_factorize(long long n) {
  vector<pair<long long, long long>> res;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i != 0) {
      continue;
    }
    int num = 0;
    while (n % i == 0) {
      ++num;
      n /= i;
    }
    res.push_back(make_pair(i, num));
  }
  if (n != 1) {
    res.push_back(make_pair(n, 1));
  }
  return res;
}
long long GCD(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return GCD(b, a % b);
}
long long lcm(long long x, long long y) { return x / GCD(x, y) * y; }
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void dfs(int st, int fi) {
  if (st < 0 || fi < 0 || st >= H || fi >= W) {
    return;
  }
  if (S[st][fi] == '#') {
    return;
  }
  if (seen[st][fi] == 1) {
    return;
  }
  if (S[st][fi] == '.') {
    seen[st][fi] = 1;
  }
  dfs(st + 1, fi);
  dfs(st, fi + 1);
  dfs(st, fi - 1);
  dfs(st - 1, fi);
}
int main() {
  int N;
  cin >> N;
  vector<int> a(N), sum(9);
  for (int i = 0; i < N; i++) {
    cin >> a[i];
  }
  int ans = 0;
  for (int i = 0; i < N; i++) {
    if (a[i] >= 1 && a[i] <= 399) {
      sum[0]++;
    } else if (a[i] >= 400 && a[i] <= 799) {
      sum[1]++;
    } else if (a[i] >= 800 && a[i] <= 1199) {
      sum[2]++;
    } else if (a[i] >= 1200 && a[i] <= 1599) {
      sum[3]++;
    } else if (a[i] >= 1600 && a[i] <= 1999) {
      sum[4]++;
    } else if (a[i] >= 2000 && a[i] <= 2399) {
      sum[5]++;
    } else if (a[i] >= 2400 && a[i] <= 2799) {
      sum[6]++;
    } else if (a[i] >= 2800 && a[i] <= 3199) {
      sum[7]++;
    } else {
      sum[8]++;
    }
  }
  for (int i = 0; i < 9; i++) {
    if (sum[i] >= 1) ans += 1;
  }
  cout << ans << " " << ans - 1 + sum[8] << endl;
  return 0;
}
