#include <bits/stdc++.h>
unsigned long long n;
unsigned long long a[100];
void swap_adj(unsigned long long *a, unsigned long long *b) {
  unsigned long long tmp = *b;
  *b = *a;
  *a = tmp;
  return;
}
int min(int a, int b) {
  if (a < b) return a;
  return b;
}
int comp(const void *a, const void *b) {
  if (*(unsigned long long *)a > *(unsigned long long *)b) {
    return -1;
  } else if (*(unsigned long long *)a < *(unsigned long long *)b) {
    return +1;
  } else {
    return 0;
  }
}
int solve() {
  int b[8] = {0}, tourist = 0, izryt = 0;
  int i;
  for (i = 0; i < n; i++) {
    if (a[i] >= 3200) {
      tourist++;
    } else {
      b[a[i] / 400] = 1;
    }
  }
  for (i = 0; i < 8; i++) {
    if (b[i]) izryt++;
  }
  printf("%d %d\n", izryt, min(izryt + tourist, 8));
  return 0;
}
int main(void) {
  unsigned long long i;
  scanf("%llu", &n);
  for (i = 0; i < n; i++) {
    scanf("%llu", &a[i]);
  }
  solve();
  return 0;
}
