#include <bits/stdc++.h>
using std::cin;
using std::cout;
using namespace std;
long long gcd(long long a, long long b) {
  while (b != 0) {
    auto tmp = a;
    a = b;
    b = tmp % a;
  }
  return a;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
int isPrime(int a) {
  for (int i = 2; i * i <= a; ++i) {
    if (a % i == 0) {
      return 0;
    }
  }
  return 1;
}
void oneCase() {
  int n;
  cin >> n;
  vector<int> id(9);
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    if (a >= 3200) {
      ++id[8];
    } else {
      id[a / 400] = 1;
    }
  }
  if (id.back() == 0) {
    auto a = accumulate(id.begin(), id.end(), 0);
    cout << a << " " << a << "\n";
  } else {
    auto a = accumulate(id.begin(), id.end(), 0) - id.back();
    cout << max(a, 1) << " " << a + min(9 - a, id.back()) << "\n";
  }
}
int main() {
  int t = 1;
  while (t > 0) {
    oneCase();
    --t;
  }
  return 0;
}
