#include <bits/stdc++.h>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
  std::fill((T *)array, (T *)(array + N), val);
}
struct edge {
  int to, cost;
};
int C, N, W, H, ans[2], dp[9];
string S;
static const int dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
                 dy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int A[102];
void solve() {
  for (int i = 0; i < N; ++i) {
    if (A[i] / 400 < 8) {
      dp[A[i] / 400]++;
    } else {
      dp[8]++;
    }
  }
  for (int i = 0; i < 7; ++i) {
    if (dp[i]) {
      ans[0]++;
    }
  }
  ans[1] = ans[0] + dp[8];
  if (!ans[0]) {
    ans[0] = 1;
  }
}
void debug() {}
void answer() { cout << ans[0] << " " << ans[1] << endl; }
int main() {
  cin >> N;
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }
  solve();
  debug();
  answer();
  return 0;
}
