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