#include <bits/stdc++.h>
using namespace std;
template <typename T, size_t N>
int SIZE(const T (&t)[N]) {
  return N;
}
template <typename T>
int SIZE(const T &t) {
  return t.size();
}
string to_string(const string s, int x1 = 0, int x2 = 1e9) {
  return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char c) { return string({c}); }
template <size_t N>
string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) {
  string t = "";
  for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
       __iii__ <= __jjj__; ++__iii__) {
    t += b[__iii__] + '0';
  }
  return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  l_v_l_v_l++;
  string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
  l_v_l_v_l--;
  return res;
}
template <typename A, typename... C>
string to_string(const A(&v), int x1, int x2, C... coords) {
  int rnk = rank<A>::value;
  string tab(t_a_b_s, ' ');
  string res = "";
  bool first = true;
  if (l_v_l_v_l == 0) res += '\n';
  res += tab + "[";
  x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
  auto l = begin(v);
  advance(l, x1);
  auto r = l;
  advance(r, (x2 - x1) + (x2 < SIZE(v)));
  for (auto e = l; e != r; e = next(e)) {
    if (!first) {
      res += ", ";
    }
    first = false;
    l_v_l_v_l++;
    if (e != l) {
      if (rnk > 1) {
        res += '\n';
        t_a_b_s = l_v_l_v_l;
      };
    } else {
      t_a_b_s = 0;
    }
    res += to_string(*e, coords...);
    l_v_l_v_l--;
  }
  res += "]";
  if (l_v_l_v_l == 0) res += '\n';
  return res;
}
void debugm() { ; }
template <typename Heads, typename... Tails>
void debugm(Heads H, Tails... T) {
  cerr << to_string(H) << " | ";
  debugm(T...);
}
double round(double num, int dec) {
  return std::round(num * pow(10, dec)) / pow(10, dec);
}
template <typename T>
string toString(T x) {
  string s;
  while (x) {
    s.push_back(x % 10 + '0');
    x /= 10;
  }
  reverse(s.begin(), s.end());
  return s;
}
long long toInt(string &x) {
  long long sum = 0;
  for (int i = 0; i < x.size(); i++) {
    sum *= 10;
    sum += (x[i] - '0');
  }
  return sum;
}
vector<string> split(string s, char delim) {
  replace(s.begin(), s.end(), delim, ' ');
  stringstream second(s);
  string buf;
  vector<string> v;
  while (second >> buf) v.push_back(buf);
  return v;
}
template <typename T, int size>
int siz(T (&)[size]) {
  return size;
}
long long POW(long long base, long long exp) {
  long long res = 1;
  while (exp > 0) {
    if (exp % 2 == 1) {
      res = (res * base) % 1000000007;
    }
    exp = exp >> 1;
    base = (base * base) % 1000000007;
  }
  return res;
}
int gcd(int a, int b) { return (b == 0 ? a : gcd(b, a % b)); }
int lcm(int a, int b) { return a * (b / gcd(a, b)); }
bool vis[8];
int main() {
  int n;
  cin >> n;
  int big = 0;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] >= 3200)
      big++;
    else if (a[i] <= 399)
      vis[0] = 1;
    else if (a[i] >= 400 && a[i] <= 799)
      vis[1] = 1;
    else if (a[i] >= 800 && a[i] <= 1199)
      vis[2] = 1;
    else if (a[i] >= 1200 && a[i] <= 1599)
      vis[3] = 1;
    else if (a[i] >= 1600 && a[i] <= 1999)
      vis[4] = 1;
    else if (a[i] >= 2000 && a[i] <= 2399)
      vis[5] = 1;
    else if (a[i] >= 2400 && a[i] <= 2799)
      vis[6] = 1;
    else if (a[i] >= 2800 && a[i] <= 3199)
      vis[7] = 1;
  }
  int base = 0;
  for (int i = 0; i < 8; i++) {
    if (vis[i]) base++;
  }
  cout << base << " " << base + big;
}
