#include <bits/stdc++.h>
using namespace std;
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;
using ll = long long;
using ull = unsigned long long;
using vi = vector<long long>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<long long, long long>;
using vs = vector<string>;
using Graph = vvi;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using minPQ = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
  for (auto &v : vec) is >> v;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "[";
  for (auto v : vec) os << v << ",";
  os << "]";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const deque<T> &vec) {
  os << "deq[";
  for (auto v : vec) os << v << ",";
  os << "]";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &vec) {
  os << "{";
  for (auto v : vec) os << v << ",";
  os << "}";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &vec) {
  os << "{";
  for (auto v : vec) os << v << ",";
  os << "}";
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &pa) {
  os << "(" << pa.first << "," << pa.second << ")";
  return os;
}
template <typename TK, typename TV>
ostream &operator<<(ostream &os, const map<TK, TV> &make_pair) {
  os << "{";
  for (auto v : make_pair) os << v.first << "=>" << v.second << ",";
  os << "}";
  return os;
}
const long long INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const long long MOD = 1e9 + 7;
const long long dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
                dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
inline bool inside(long long y, long long x, long long H, long long W) {
  return y >= 0 && x >= 0 && y < H && x < W;
}
template <typename T>
inline bool chmin(T &a, const T &b) {
  if (a > b) a = b;
  return a > b;
}
template <typename T>
inline bool chmax(T &a, const T &b) {
  if (a < b) a = b;
  return a < b;
}
template <class T>
T gcd(const T &a, const T &b) {
  return a < b ? gcd(b, a) : b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(const T &a, const T &b) {
  return a / gcd(a, b) * b;
}
template <class T>
T div_ceil(const T &a, const T &b) {
  return (a + b - 1) / b;
}
long long rate(long long score) {
  vi list = {1, 400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
  return upper_bound(begin(list), end(list), score) - list.begin();
}
pair<long long, long long> solve(set<long long> &c, long long star) {
  if (c.size() == 0)
    return make_pair(1, min(8ll, star));
  else
    return make_pair(c.size(), min(8ull, c.size() + star));
}
signed main() {
  long long n;
  cin >> n;
  vi a(n);
  cin >> a;
  set<long long> c;
  long long star = 0;
  for (long long i = (0); i < (n); i++) {
    long long color = rate(a[i]);
    if (color == 9)
      star++;
    else
      c.insert(color);
  }
  pair<long long, long long> ans = solve(c, star);
  cout << ans.first << " " << ans.second << endl;
}
