#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;
const int inf = 1001001001;
const lint linf = 1001001001001001001ll;
const int mod = 1e9 + 7;
const int dx[]{0, 1, 0, -1, -1, -1, 1, 1}, dy[]{1, 0, -1, 0, -1, 1, -1, 1};
template <typename T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
  }
  return a > b;
}
template <typename T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
  }
  return a < b;
}
template <typename T>
inline void print(const T &x, string s = "\n") {
  cout << x << s;
}
template <typename T>
inline void print(const vector<T> &v, string s = " ") {
  for (int i = 0; i < v.size(); ++i)
    cout << v[i] << (i + 1 == v.size() ? "\n" : s);
}
inline bool inside(int y, int x, int H, int W) {
  return 0 <= y && y < H && 0 <= x && x < W;
}
inline lint in() {
  lint x;
  std::cin >> x;
  return x;
}
int a[101];
int main() {
  int n = in();
  for (int i = 0; i < n; ++i) {
    int b = in();
    if (b > 3200) b = 3200;
    a[b / 400]++;
  }
  int cnt = 0;
  for (int i = 0; i < 8; ++i) {
    if (a[i]) cnt++;
  }
  cout << cnt << " " << cnt + a[8] << endl;
}
