#include <bits/stdc++.h>
using namespace std;
const int inf = 99999999;
const long long linf = 999999999999999999;
const double pi = acos(-1);
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
long long modpow(long long i, long long j) {
  long long tmp = 1;
  while (j) {
    if (j % 2) tmp = ((tmp * i) % (long long)(1e9 + 7));
    i = ((i * i) % (long long)(1e9 + 7));
    j /= 2;
  }
  return tmp;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
int main() {
  int n;
  map<int, int> m;
  cin >> n;
  int a[1005] = {};
  for (int i = (0); i < (int)(n); i++) {
    cin >> a[i];
    if (a[i] >= 3200)
      m[0]++;
    else if (a[i] >= 2800)
      m[1]++;
    else if (a[i] >= 2400)
      m[2]++;
    else if (a[i] >= 2000)
      m[3]++;
    else if (a[i] >= 1600)
      m[4]++;
    else if (a[i] >= 1200)
      m[5]++;
    else if (a[i] >= 800)
      m[6]++;
    else if (a[i] >= 400)
      m[7]++;
    else
      m[8]++;
  }
  int cnt = ((int)(m).size());
  if (m[0] > 0) {
    cnt--;
    int ma = cnt + m[0];
    cout << cnt << " " << ma << endl;
  } else {
    cout << cnt << " " << cnt << endl;
  }
  return 0;
}
