#include <bits/stdc++.h>
using ll = long long;
using namespace std;
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
const long long INFLL = 1LL << 62;
const int INF = 1 << 30;
const double PI = acos(-1);
int main() {
  int n;
  map<int, int> a;
  int ans1 = 0;
  int ans2 = 0;
  cin >> n;
  int bef;
  for (int i = 0, i_len = (int)(n); i < i_len; i++) {
    cin >> bef;
    a[min(bef / 400, 8)] += 0;
    a[min(bef / 400, 8)]++;
  }
  ans1 = a.size() - 1;
  if (ans1 == 0) {
    ans1 = 1;
  }
  a[8] += 0;
  ans2 = ans1 + a[8];
  printf("%d %d\n", ans1, ans2);
}
