#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
struct Union {
  vector<ll> par;
  Union(ll a) { par = vector<ll>(a, -1); }
  ll find(ll a) {
    if (par[a] < 0) {
      return a;
    } else {
      return par[a] = find(par[a]);
    }
  }
  bool same(ll a, ll b) { return (find(a) == find(b)); }
  ll size(ll a) { return -par[find(a)]; }
  void unite(ll a, ll b) {
    ll c = find(a), d = find(b);
    if (c == d) return;
    if (size(c) < size(d)) {
      swap(c, d);
    }
    par[c] += par[d];
    par[d] = c;
  }
};
ll euclidean_gcd(ll a, ll b) {
  if (a < b) return euclidean_gcd(b, a);
  ll r;
  while ((r = a % b)) {
    a = b;
    b = r;
  }
  return b;
}
ll euclidean_lcm(ll a, ll b) { return a / euclidean_gcd(a, b) * b; }
ll binary(ll bina) {
  ll ans = 0;
  for (ll i = 0; bina > 0; i++) {
    ans += bina % 2;
    bina = bina / 2;
  }
  return ans;
}
void revStr(char* str) {
  int size = strlen(str);
  int i, j;
  char tmp = {0};
  for (i = 0, j = size - 1; i < size / 2; i++, j--) {
    tmp = str[i];
    str[i] = str[j];
    str[j] = tmp;
  }
  return;
}
int main(void) {
  int n;
  cin >> n;
  int a[n], b[13];
  for (ll i = 0; i < 13; ++i) {
    b[i] = 0;
  }
  int k;
  for (ll i = 0; i < n; ++i) {
    cin >> a[i];
    k = a[i] / 400;
    b[k]++;
  }
  int ans = 0;
  for (ll i = 0; i < 8; ++i) {
    if (b[i] >= 1) ans++;
  }
  cout << ans << " ";
  ans = ans + b[8] + b[9] + b[10] + b[11] + b[12];
  cout << ans;
}
