#include <bits/stdc++.h>
using namespace std;
int ans, a[11], n, i, fs;
int zx;
int main() {
  scanf("%d", &n);
  for (i = 1; i <= n; i++) {
    scanf("%d", &fs);
    if (fs >= 1 && fs <= 399) {
      a[1]++;
      if (a[1] == 1) zx++;
    } else if (fs <= 799) {
      a[2]++;
      if (a[2] == 1) zx++;
    } else if (fs <= 1199) {
      a[3]++;
      if (a[3] == 1) zx++;
    } else if (fs <= 1599) {
      a[4]++;
      if (a[4] == 1) zx++;
    } else if (fs <= 1999) {
      a[5]++;
      if (a[5] == 1) zx++;
    } else if (fs <= 2399) {
      a[6]++;
      if (a[6] == 1) zx++;
    } else if (fs <= 2799) {
      a[7]++;
      if (a[7] == 1) zx++;
    } else if (fs <= 3199) {
      a[8]++;
      if (a[8] == 1) zx++;
    } else if (fs >= 3200)
      ans++;
  }
  if (zx > 0)
    printf("%d %d\n", zx, min(8, ans + zx));
  else
    printf("%d %d\n", 1, min(8, ans));
  return 0;
}
