#include <bits/stdc++.h>
using namespace std;
long long gcd(long long x, long long y) {
  long long tmp = 0;
  if (x < y) {
    tmp = x;
    x = y;
    y = tmp;
  }
  while (y > 0) {
    long long r = x % y;
    x = y;
    y = r;
  }
  return x;
}
long long lcm(long long x, long long y) { return x / gcd(x, y) * y; }
long long kaijo(long long k) {
  long long sum = 1;
  for (long long i = 1; i <= k; ++i) {
    sum *= i;
    sum %= 1000000000 + 7;
  }
  return sum;
}
int main() {
  int n;
  cin >> n;
  int a[n];
  int b[9];
  for (int i = 0; i < 9; i++) b[i] = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    int c = a[i] / 400;
    if (c > 7) {
      b[8]++;
    } else {
      b[c]++;
    }
  }
  int counter = 0;
  for (int i = 0; i < 8; i++) {
    if (b[i] > 0) counter++;
  }
  cout << max(counter, 1) << " ";
  if (counter + b[8] >= 8) {
    cout << 8 << endl;
  } else {
    cout << counter + b[8] << endl;
  }
  return 0;
}
