#include <bits/stdc++.h>
int main() {
  std::priority_queue<int> q;
  int a, n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a);
    q.push(a);
  }
  int hype = 0;
  bool color[8] = {};
  while (q.top() >= 3200) {
    hype++;
    q.pop();
  }
  while (!q.empty()) {
    color[q.top() / 400] = true;
    q.pop();
  }
  int min = 0;
  int max = 0;
  for (int i = 0; i < 8; i++) {
    if (color[i]) min++;
  }
  max = hype + min;
  printf("%d %d\n", min, max);
  return 0;
}
