#include <bits/stdc++.h>
using namespace std;
typedef struct edge_ {
  long long to, cost;
  edge_(long long to, long long cost) : to(to), cost(cost) {}
} edge;
typedef struct point_ {
  long long x, y;
  point_(long long x = 0, long long y = 0) : x(x), y(y) {}
} point;
template <typename T>
using mat2d = vector<vector<T>>;
constexpr double PI = 3.14159265358979323846;
constexpr int INF = (int)1e7;
constexpr long long MOD = (long long)1e9 + 7;
constexpr double EPS = 1e-7;
constexpr int dy4[4] = {0, 1, 0, -1};
constexpr int dx4[4] = {1, 0, -1, 0};
constexpr int dy8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
constexpr int dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1};
template <typename T>
istream& operator>>(istream& is, vector<T>& vec) {
  for (T& x : vec) is >> x;
  return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
  for (const T& x : vec) os << x << " ";
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<vector<T>>& mat) {
  for (const vector<T>& m : mat) os << m << endl;
  return os;
}
template <typename S, typename T>
istream& operator>>(istream& is, pair<S, T>& p) {
  is >> p.first >> p.second;
  return is;
}
istream& operator>>(istream& is, point& p) {
  is >> p.x >> p.y;
  return is;
}
template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p) {
  os << "{" << p.first << " : " << p.second << "}";
  return os;
}
template <typename T>
ostream& operator<<(ostream& os, const set<T>& s) {
  for (const T& x : s) os << x << " ";
  return os;
}
ostream& operator<<(ostream& os, const edge e) {
  os << "{to: " << e.to << ", cost: " << e.cost << "}";
  return os;
}
ostream& operator<<(ostream& os, const point& p) {
  os << "(" << p.x << " " << p.y << ")";
  return os;
}
int main() {
  int N;
  cin >> N;
  vector<int> a(N);
  cin >> a;
  map<int, int> M;
  for (int i = 0; i < N; i++) M[min(a[i] / 400, 8)]++;
  int ans_min = 0, ans_max = 0;
  for (int i = 0; i <= 8; i++) {
    if (i < 8) {
      ans_min += (M[i] > 0) ? 1 : 0;
      ans_max += (M[i] > 0) ? 1 : 0;
    } else {
      ans_max += M[i];
    }
  }
  cout << ans_min << " " << min(ans_max, 7) << endl;
  return 0;
}
