#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(int argc, char **argv) {
  ll n;
  cin >> n;
  vector<ll> a(n);
  for (ll i = 0; i < n; ++i) cin >> a[i];
  vector<ll> v(9, 0);
  for (ll i = 0; i < n; ++i) {
    ll rate = a[i];
    v[rate / 400]++;
  }
  ll free_coder = v[8];
  ll exist_coder{0};
  for (ll i = 0; i < 8; ++i) {
    if (v[i] != 0) ++exist_coder;
  }
  ll min, max;
  if (free_coder == 0) {
    min = max = exist_coder;
  } else if (free_coder >= (8 - exist_coder)) {
    min = exist_coder;
    max = 8;
  } else if (free_coder < (8 - exist_coder)) {
    min = exist_coder;
    max = exist_coder + free_coder;
  } else {
    std::cout << "Not reach." << std::endl;
  }
  std::cout << min << " " << max << std::endl;
}
