#include <bits/stdc++.h>
using namespace std;
const double pi =
    3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
const int mod = 1000000007;
int main() {
  int n, i, j, a[111] = {}, r, cl[8] = {};
  int c = 0, maxc = 0, minc = 1;
  cin >> n;
  for (int i = (0); i < (n); ++i) {
    cin >> r;
    if (r > 3200)
      a[i] = 8;
    else
      a[i] = r / 400;
  }
  a[n] = 10;
  sort(a, a + n);
  for (int i = (0); i < (8); ++i) {
    if (a[lower_bound(a, a + n, i) - a] == i) {
      cl[i] = 1;
      c++;
    }
  }
  if (c > 1) minc = c;
  int tar = upper_bound(a, a + n, 8) - lower_bound(a, a + n, 8);
  c += tar;
  if (c > 8) c = 8;
  cout << minc << " " << c << endl;
  return 0;
}
