#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a[4850], f[9];
  while (scanf("%d", &n) == 1) {
    int cnt = 0, sum = 0;
    memset(f, 0, sizeof(f));
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
      if (a[i] >= 1 && a[i] <= 399) f[1] = 1;
      if (a[i] >= 400 && a[i] <= 799) f[2] = 1;
      if (a[i] >= 800 && a[i] <= 1199) f[3] = 1;
      if (a[i] >= 1200 && a[i] <= 1599) f[4] = 1;
      if (a[i] >= 1600 && a[i] <= 1999) f[5] = 1;
      if (a[i] >= 2000 && a[i] <= 2399) f[6] = 1;
      if (a[i] >= 2400 && a[i] <= 2799) f[7] = 1;
      if (a[i] >= 2800 && a[i] <= 3199) f[8] = 1;
      if (a[i] > 3199) cnt++;
    }
    for (int i = 1; i < 9; i++) {
      if (f[i] == 1) sum++;
    }
    cnt += sum;
    printf("%d %d\n", sum, cnt);
  }
  return 0;
}
