#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < (n); ++i) cin >> a[i];
  vector<int> exist(8, 0);
  int r = 0;
  for (int i = 0; i < (n); ++i) {
    for (int j = 0; j < (8); ++j)
      if (a[i] >= 400 * j && a[i] < 400 * (j + 1)) exist[j] = 1;
    if (a[i] >= 3200) ++r;
  }
  int m = 0;
  for (int i = 0; i < (8); ++i) m += exist[i];
  int M = m + r;
  printf("%d %d\n", m, M);
  return 0;
}
