#include <bits/stdc++.h>
int v[9], fr[9];
int main() {
  int n, i, j, col, rank;
  scanf("%d", &n);
  v[0] = 400 - 1;
  for (i = 1; i < 8; i++) v[i] = v[i - 1] + 400;
  for (i = 0; i < n; i++) {
    scanf("%d", &rank);
    if (rank > v[7])
      fr[8]++;
    else {
      j = 0;
      while (j < 8 && rank > v[j]) j++;
      fr[j - 1]++;
    }
  }
  col = 0;
  for (i = 0; i < 8; i++)
    if (fr[i] != 0) col++;
  printf("%d %d", col, col + fr[8]);
  return 0;
}
