#include <bits/stdc++.h>
using namespace std;
long int pow107 = (int)pow(10, 9) + 7;
int ilimit = INT_MAX;
long int llimit = LONG_MAX;
bool comp(pair<int, string> a, pair<int, string> b) {
  if (a.first != b.first)
    return a.first > b.first;
  else
    return a.second < b.second;
}
long int jou(long int x, long int y) {
  long int f = 1;
  for (int i = 0; i < y; ++i) {
    f = f * x % pow107;
  }
  return f;
}
bool pn(long int x) {
  if (x != 2 && x % 2 == 0) return false;
  for (int i = 3; i < x; ++i) {
    if (x != i && x % i == 0) return false;
  }
  return true;
}
long int factorial(long int n) {
  long int f = 1;
  for (long int i = 1; i <= n; ++i) {
    f = f * i % pow107;
  }
  return f;
}
int main() {
  int c[9] = {};
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    int a;
    cin >> a;
    if (a >= 3200) {
      c[8]++;
    } else if (a >= 2800) {
      c[7]++;
    } else if (a >= 2400) {
      c[6]++;
    } else if (a >= 2000) {
      c[5]++;
    } else if (a >= 1600) {
      c[4]++;
    } else if (a >= 1200) {
      c[3]++;
    } else if (a >= 800) {
      c[2]++;
    } else if (a >= 400) {
      c[1]++;
    } else {
      c[0]++;
    }
  }
  int zero = 0, nozero = 0;
  for (int i = 0; i < 8; ++i) {
    if (c[i] == 0)
      zero++;
    else
      nozero++;
  }
  cout << nozero << " " << (zero - c[8] <= 0 ? 8 : nozero + c[8]) << endl;
}
