#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
long long N, K;
long long x[100];
int main(void) {
  cin >> N;
  for (int i = 0; i < N; i++) {
    int a, b = -1;
    cin >> a;
    if (a < 400)
      b = 0;
    else if (a < 800)
      b = 1;
    else if (a < 1200)
      b = 2;
    else if (a < 1600)
      b = 3;
    else if (a < 2000)
      b = 4;
    else if (a < 2400)
      b = 5;
    else if (a < 2800)
      b = 6;
    else if (a < 3200)
      b = 7;
    if (b != -1)
      x[b] = 1;
    else
      x[b]++;
  }
  int c = count(&x[0], &x[8], 1);
  int ma = c, mi = c;
  while (x[0] > 0) {
    x[0]--;
    ma++;
    if (c > 8) ma--;
  }
  if (mi == 0)
    mi = 1;
  else
    mi = (c < 8) ? mi = c : mi = 8;
  cout << mi << " " << ma;
  return 0;
}
