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