#include <bits/stdc++.h>
using namespace std;
string to_hex(int x) {
  stringstream ss;
  ss << hex << x;
  return ss.str();
}
inline int get_int() {
  int ret;
  scanf("%d", &ret);
  return ret;
}
inline vector<int> get_ints(int n) {
  vector<int> ret(n);
  for (int i = 0; i < (int)n; i++) {
    scanf("%d", &ret[i]);
  }
  return ret;
}
inline string get_str() {
  string ret;
  cin >> ret;
  return ret;
}
bool is_prime(int n) {
  int s = sqrt(n) + 1;
  for (int i = 2; i <= s; ++i) {
    if (n % i == 0) {
      return 0;
    }
  }
  return 1;
}
vector<pair<int, int> > prime_division(int n) {
  vector<pair<int, int> > ret;
  int s = sqrt(n) + 1;
  int c = 0;
  for (int i = 2; i <= n; ++i) {
    if (n % i == 0) {
      c = 0;
      do {
        ++c;
        n /= i;
      } while (n % i == 0);
      ret.push_back(pair<int, int>(i, c));
    }
  }
  return ret;
}
struct UnionFind {
  vector<int> data;
  UnionFind(int size) { data = vector<int>(size, -1); }
  bool union_set(int x, int y) {
    x = root(x);
    y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y];
      data[y] = x;
    }
    return x != y;
  }
  bool find(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};
string to_string(string s) { return s; }
template <class T>
string to_string(vector<T> v) {
  string ret = "{";
  for (int i = 0; i < (int)v.size() - 1; i++) {
    ret += to_string(v[i]) + ",";
  }
  if (v.size() > 0) {
    ret += to_string((v)[(v).size() - 1]);
  }
  ret += "}";
  return ret;
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail>
void debug_print(Head head, Tail... tail) {
  cerr << to_string(head) << " ";
  debug_print(tail...);
}
template <class... T>
void debug(T... args) {
  cerr << "[" << 102 << "]: ";
  debug_print(args...);
}
void print() { cout << endl; }
template <class Head, class... Tail>
void print(Head head, Tail... tail) {
  cout << to_string(head);
  print(tail...);
}
int main() {
  int(N);
  scanf("%d", &(N));
  int list[9] = {};
  for (int i = 0; i < (int)N; i++) {
    int(a);
    scanf("%d", &(a));
    list[min(8, a / 400)]++;
  }
  int ans = 0;
  for (int i = 0; i < (int)8; i++) {
    if (list[i]) ans++;
  }
  cout << ans << " " << min(8, ans + list[8]) << endl;
  return 0;
}
