#include <bits/stdc++.h>
int main() {
  int N;
  scanf("%d", &N);
  std::set<int> set;
  int upper = 0;
  for (int i = 0; i < N; ++i) {
    int a;
    scanf("%d", &a);
    a /= 400;
    if (a < 8) {
      set.insert(a);
    } else {
      ++upper;
    }
  }
  int lower = 0;
  for (int i = 0; i < 8; ++i) lower += set.count(i);
  int min = std::max(lower, upper);
  int max = lower + upper;
  printf("%d %d\n", min, max);
  return 0;
}
