#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
const long long int INF = 1e9;
int main() {
  int n, a[100] = {0};
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int cnt[8] = {0};
  int ram = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] <= 399) {
      cnt[0]++;
    } else if (a[i] <= 799) {
      cnt[1]++;
    } else if (a[i] <= 1199) {
      cnt[2]++;
    } else if (a[i] <= 1599) {
      cnt[3]++;
    } else if (a[i] <= 1999) {
      cnt[4]++;
    } else if (a[i] <= 2399) {
      cnt[5]++;
    } else if (a[i] <= 2799) {
      cnt[6]++;
    } else if (a[i] <= 3199) {
      cnt[7]++;
    } else {
      ram++;
    }
  }
  if (ram > 8) {
    ram = 8;
  }
  int sol = 0;
  for (int i = 0; i < 8; i++) {
    if (cnt[i] != 0) {
      sol++;
    }
  }
  if (ram == 0) {
    printf("%d %d\n", sol, sol);
  } else {
    if (sol == 0) {
      printf("%d %d\n", 1, ram);
    } else {
      printf("%d %d\n", sol, sol + ram);
    }
  }
  return 0;
}
