#include <bits/stdc++.h>
using namespace std;
int a[1010], cnt[12], n, ans, ans1, ans2;
inline int gi() {
  register int x = 0, q = 1;
  register char ch = getchar();
  while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
  if (ch == '-') q = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - 48, ch = getchar();
  return q * x;
}
inline void work() {
  n = gi();
  for (register int i = 1; i <= n; ++i) a[i] = gi();
  for (register int i = 1; i <= n; ++i) {
    if (a[i] >= 1 && a[i] <= 399) cnt[0] = 1;
    if (a[i] >= 400 && a[i] <= 799) cnt[1] = 1;
    if (a[i] >= 800 && a[i] <= 1199) cnt[2] = 1;
    if (a[i] >= 1200 && a[i] <= 1599) cnt[3] = 1;
    if (a[i] >= 1600 && a[i] <= 1999) cnt[4] = 1;
    if (a[i] >= 2000 && a[i] <= 2399) cnt[5] = 1;
    if (a[i] >= 2400 && a[i] <= 2799) cnt[6] = 1;
    if (a[i] >= 2800 && a[i] <= 3199) cnt[7] = 1;
    if (a[i] >= 3200) cnt[8]++;
  }
  for (register int i = 0; i <= 7; ++i) ans += cnt[i];
  if (ans >= cnt[8])
    ans1 = ans;
  else
    ans1 = cnt[8];
  ans2 = ans + cnt[8];
  if (ans2 > 8) ans2 = 8;
  printf("%d %d\n", ans1, ans2);
  return;
}
int main() {
  work();
  return 0;
}
