#include <bits/stdc++.h>
long long inf = (long long)1E17;
long mod(long a) {
  long long c = a % (long long)(1E9 + 7);
  if (c >= 0) return c;
  return c + (long long)(1E9 + 7);
}
using namespace std;
long long gcd(long long a, long long b) {
  if (a < b) {
    swap(a, b);
  }
  if (a % b == 0) {
    return b;
  } else {
    return gcd(b, a % b);
  }
}
long long lcm(long long x, long long y) { return (x / gcd(x, y)) * y; }
class UnionFind {
 public:
  vector<int> Parent;
  UnionFind(int N) { Parent = vector<int>(N, -1); }
  int root(int A) {
    if (Parent[A] < 0) return A;
    return Parent[A] = root(Parent[A]);
  }
  int size(int A) { return -Parent[root(A)]; }
  bool connect(int A, int B) {
    A = root(A);
    B = root(B);
    if (A == B) {
      return false;
    }
    if (size(A) < size(B)) swap(A, B);
    Parent[A] += Parent[B];
    Parent[B] = A;
    return true;
  }
};
int main() {
  int n, r;
  cin >> n;
  vector<bool> exist(8, false);
  int var = 0;
  for (int i = 0; i < n; i++) {
    cin >> r;
    for (int j = 0; j < 8; j++) {
      if (r < 400 * (j + 1)) {
        exist[j] = true;
        break;
      }
    }
    if (r >= 3200) {
      var++;
    }
  }
  int m = 0;
  for (int i = 0; i < exist.size(); i++) {
    if (exist[i]) {
      m++;
    }
  }
  cout << m << " ";
  cout << m + var;
  return 0;
}
